On the computation of robust examination timetables: methods and experimental results

Abstract With ever-rising student numbers and an increasing shift towards more interdisciplinary study programs, the requirements for finding schedules for courses and exams become ever more complex. In real-world scenarios, the models used for calculating solutions to the course and the examination timetabling problem often must be provided to the students at the time of registration. In the field of curriculum-based course timetabling, timetables are calculated based on the structure of the study programs. For the examination timetabling problem, only a few papers focus on scheduling exams without registration data, as the requirements for exams are often more strict, or partial information is known from course registrations. In this paper we show that with the use of robustness techniques, we can also define the examination timetabling problem based on curricula. We introduce three robustness measures that address the inherent uncertainty when using the curriculum-based model. These robustness measures, along with other quality measures, are analyzed using a multi-objective simulated annealing algorithm. The results are compared on the Pareto front approximations found. We present a case study showing that, without a significant loss in solution quality, the chance is significantly reduced that rescheduling will be required after the exact numbers for the model are known.