Finding a feasible course schedule using Tabu search

The paper considers a course scheduling problem in which the total number of time periods assigned to each topic has to be split into daily amounts of consecutive time periods called daily quantums. These daily quantums may be arbitrary but are bounded by given minimal and maximal values. In addition to the classical constraints of course scheduling problems, precedence and time windows requirements are taken into account. The paper describes a new method based on Tabu search techniques for finding a feasible course schedule.