Tabu Search Techniques for Examination Timetabling

Abstract

The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairly spreading the exams for the students, and satisfying room capacity constraints. We present a family of solution algorithms for a set of variants of the Examination Timetabling problem. The algorithms are based on tabu search, and they import several features from the research on the Graph Colouring problem. Our algorithms are tested on both public benchmarks and random instances, and compared with previous results in the literature.

DOI: 10.1007/3-540-44629-X_7

Extracted Key Phrases

3 Figures and Tables

Statistics

02040'01'03'05'07'09'11'13'15'17
Citations per Year

261 Citations

Semantic Scholar estimates that this publication has 261 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Gaspero2000TabuST, title={Tabu Search Techniques for Examination Timetabling}, author={Luca Di Gaspero and Andrea Schaerf}, booktitle={PATAT}, year={2000} }