ALCOMFT-TR-01-27

Massimiliano Caramia, Paolo Dell'Olmo and Giuseppe F. Italiano
New Algorithms for Examination Timetabling
Rome. Work package 5. March 2001.

Abstract: In examination timetabling a given set of examinations must be assigned to as few time slots as possible so as to satisfy certain side constraints and so as to reduce penalties deriving from proximity constraints. In this paper, we present new algorithms for this problem and report the results of an extensive experimental study. All our algorithms are based on local search and are compared with other existing implementations in the literature.

Postscript file: ALCOMFT-TR-01-27.ps.gz (95 kb).