Premium
A UNIVERSITY EXAMINATION‐SCHEDULING MODEL TO MINIMIZE MULTIPLE‐EXAMINATION DAYS FOR STUDENTS
Author(s) -
Anderson John M.,
Bernhard Richard H.
Publication year - 1981
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/j.1540-5915.1981.tb00078.x
Subject(s) - scheduling (production processes) , computer science , mathematical optimization , job shop scheduling , branch and bound , operations research , algorithm , mathematics , schedule , operating system
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.