Search results

Scheduling university examinations is often done with the objective of spreading a student's required examinations over an examination week. That is the equivalent of the problem of minimizing the number of examinations a student must take on any one day. An approach to scheduling exams which relates the problem to the classical assignment problem is discussed. The model developed is a symmetry‐constrained assignment model, and the solution method requires use of a branch‐and‐bound algorithm. Results from application of the algorithm to six semesters of actual data are presented.