Article ID: | iaor1996156 |
Country: | Netherlands |
Volume: | 76 |
Issue: | 1 |
Start Page Number: | 98 |
End Page Number: | 110 |
Publication Date: | Jul 1994 |
Journal: | European Journal of Operational Research |
Authors: | Costa Daniel |
Keywords: | combinatorial analysis |
The many constraints of different types that must be taken into account and the volume of data make the timetabling problem very hard to solve. Various specific requirements are considered in this paper. After having described precisely the problem to be solved, presents a general technique based on tabu search for finding an acceptable timetable. The resulting computerized algorithm is used for constructing different real course schedules. The results the paper obtains are very satisfactory.