Novel Local-Search-Based Approaches to University Examination Timetabling

Examination timetabling assigns examinations to a given number of time slots so that there are no conflicts. A conflict occurs if a student has to take more than one examination at the same time, or when the number of students that must take an exam exceeds the capacity of the classroom assigned. The objective is to minimize penalties from proximity constraints. We present new algorithms based on local search and report on an extensive experimental study. We consider also a variant where the concern is to produce conflict–free timetables minimizing the number of time slots, regardless of how close exams appear in the schedule. The algorithms proposed also manage the trade–off between the two objective functions and produce the best results on several standard benchmark instances, compared to the best existing algorithms.