OR Practice—A Survey of Practical Applications of Examination Timetabling Algorithms

In examination timetabling, a set of examinations must be assigned to a fixed number of periods so that no student is required to take more than one examination at a time. Each institution will normally impose a list of secondary considerations that define a “good” timetable in its environment. This paper contains a survey of actual applications of timetabling at several universities and a tutorial guide for practitioners on selecting and/or designing an algorithm for their own institutions.