A Survey of Automated Timetabling

Abstract

The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. A large number of variants of the timetabling problem have been proposed in the literature, which differ from each other based on the type of institution involved (university or school) and the type of constraints. This problem, that has been traditionally considered in the operational research field, has recently been tackled with techniques belonging also to Artificial Intelligence (e.g., genetic algorithms, tabu search, and constraint satisfaction). In this paper, we survey the various formulations of the problem, and the techniques and algorithms used for its solution.

DOI: 10.1023/A:1006576209967

Extracted Key Phrases

0204060'98'00'02'04'06'08'10'12'14'16
Citations per Year

623 Citations

Semantic Scholar estimates that this publication has 623 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Schaerf1999ASO, title={A Survey of Automated Timetabling}, author={Andrea Schaerf}, journal={Artificial Intelligence Review}, year={1999}, volume={13}, pages={87-127} }