RAPPORT A survey of automated timetabling

The timetabling problem consists in xing a sequence of meetings between teachers and students in a pre xed period of time typically a week satisfying a set of constraints of var ious types A large number of variants of the timetabling problem have been proposed in the literature which di er from each other based on the type of institution involved university or high school and the type of constraints This problem that has been traditionally con sidered in the operational research eld has recently been tackled with techniques belonging also to arti cial intelligence e g genetic algorithms tabu search simulated annealing and constraint satisfaction In this paper we survey the various formulations of the problem and the techniques and algorithms used for its solution AMS Subject Classi cation M T CR Subject Classi cation I F G