Integer programming for minimal perturbation problems in university course timetabling

Phillips, Antony E. and Walker, Cameron G. and Ehrgott, Matthias and Ryan, David M. (2017) Integer programming for minimal perturbation problems in university course timetabling. Annals of Operations Research, 252 (2). pp. 283-304. ISSN 0254-5330

[img]
Preview
PDF (Phillips_MinPertFinalSubmitted)
Phillips_MinPertFinalSubmitted.pdf - Accepted Version
Available under License Creative Commons Attribution.

Download (375kB)

Abstract

In this paper we present a general integer programming-based approach for the minimal perturbation problem in university course timetabling. This problem arises when an existing timetable contains hard constraint violations, or infeasibilities, which need to be resolved. The objective is to resolve these infeasibilities while minimising the disruption or perturbation to the remainder of the timetable. This situation commonly occurs in practical timetabling, for example when there are unexpected changes to course enrolments or available rooms. Our method attempts to resolve each infeasibility in the smallest neighbourhood possible, by utilising the exactness of integer programming. Operating within a neighbourhood of minimal size keeps the computations fast, and does not permit large movements of course events, which cause widespread disruption to timetable structure. We demonstrate the application of this method using examples based on real data from the University of Auckland.

Item Type:
Journal Article
Journal or Publication Title:
Annals of Operations Research
Additional Information:
The final publication is available at Springer via http://dx.doi.org/10.1007/s10479-015-2094-z
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
ID Code:
77963
Deposited By:
Deposited On:
26 Jan 2016 11:38
Refereed?:
Yes
Published?:
Published
Last Modified:
27 May 2020 04:21