The combinatorics of timetabling

✍ Scribed by D. de Werra

• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 714 KB
• Volume: 96
• Category: Article
• ISSN: 0377-2217
• DOI: 10.1016/s0377-2217(96)00111-7

✦ Synopsis

Various formulations of timetabling problems are given in terms of coloring problems in graphs. We consider a collection of simple class-teacher timetabling problems and review complexity issues for these formulations. This tutorial presentation (which is not claimed to be an exhaustive review nor a research contribution) includes a brief sketch of a tabu search procedure which handles many specific requirements and provides an efficient heuristic technique.