Local search and constraint programming for the post enrolment-based course timetabling problem

Abstract

We present a study of the university post-enrolment timetabling prob- lem, proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using several techniques, particularly local search, con- straint programming techniques and hybrids of these in the form of a large neigh- bourhood search scheme. Our local search approach won the competition. Our best constraint programming approach uses an original problem decomposition. Incorporating this into a large neighbourhood search scheme seems promising.