| Article ID: | iaor20083083 |
| Country: | Germany |
| Volume: | 155 |
| Issue: | 1 |
| Start Page Number: | 207 |
| End Page Number: | 225 |
| Publication Date: | Nov 2007 |
| Journal: | Annals of Operations Research |
| Authors: | Marte Michael |
| Keywords: | programming: constraints |
This paper takes three important steps towards constraint-based school timetabling: (i) It proposes a constraint model that covers many important requirements of school timetables by means of global constraints. (ii) It proposes a corresponding problem solver that learns from its earlier faults and restarts to escape non-promising parts of the search space. (iii) By reporting a large-scale computational study, it delivers a proof of concept.