A Survey of Automated Timetabling
Artificial Intelligence Review
Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Very large-scale neighborhood search techniques in timetabling problems
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A column generation scheme for faculty timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Decomposition, reformulation, and diving in university course timetabling
Computers and Operations Research
A Two-Stage Decomposition of High School Timetabling applied to cases in Denmark
Computers and Operations Research
| Hi-index | 0.00 |
University course timetabling is the conflict-free assignment of courses to weekly time slots and rooms subject to various hard and soft constraints. One goal is to meet as closely as possible professors' preferences. Building on an intuitive integer program (IP), we develop an exact decomposition approach which schedules courses first, and matches courses/times to rooms in a second stage. The subset of constraints which ensures a feasible room assignment defines the well-known partial transversal polytope. We describe it as a polymatroid, and thereby obtain a complete characterization of its facets. This enables us to add only strong valid inequalities to the first stage IP. In fact, for all practical purposes the number of facets is small. We present encouraging computational results on real-world and simulated timetabling data. The sizes of our optimally solvable instances (respecting all hard constraints) are the largest reported in the literature by far.