Integer programming for minimal perturbation problems in university course timetabling

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.

[1]  Mark Wallace,et al.  Minimal Perturbation in Dynamic Scheduling , 1998 .

[2]  Mark Wallace,et al.  Minimal Perturbance in Dynamic Scheduling , 1998, ECAI.

[3]  Hana Rudová,et al.  Complex university course timetabling , 2011, J. Sched..

[4]  Eyjólfur Ingi Ásgeirsson,et al.  Bridging the gap between self schedules and feasible schedules in staff scheduling , 2014, Ann. Oper. Res..

[5]  Mark Wallace,et al.  Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.

[6]  Matthias Ehrgott,et al.  Integer programming methods for large-scale practical classroom assignment problems , 2015, Comput. Oper. Res..

[7]  Roman Barták,et al.  A New Approach to Modeling and Solving Minimal Perturbation Problems , 2003, CSCLP.

[8]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

[9]  Amnon Meisels,et al.  Hybrid search for minimal perturbation in Dynamic CSPs , 2011, Constraints.

[10]  Matthias Ehrgott,et al.  Multicriteria Optimization (2. ed.) , 2005 .

[11]  David M. Ryan,et al.  The train driver recovery problem - A set partitioning based model and solution method , 2010, Comput. Oper. Res..

[12]  Barry McCollum,et al.  A Perspective on Bridging the Gap Between Theory and Practice in University Timetabling , 2006, PATAT.

[13]  Luca Di Gaspero,et al.  Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results , 2012, Ann. Oper. Res..

[14]  Edmund K. Burke,et al.  Towards improving the utilization of university teaching space , 2009, J. Oper. Res. Soc..

[15]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling V: 5th International Conference, PATAT 2004, Pittsburgh, PA, USA, August 18-20, 2004, Revised Selected Papers (Lecture Notes in Computer Science) , 2006 .

[16]  Jeffrey H. Kingston.  Educational Timetabling , 2013, Automated Scheduling and Planning.

[17]  Alex S. Fukunaga.  An Improved Search Algorithm for Min-Perturbation , 2013, CP.

[18]  Jeffrey H. Kingston.  Repairing high school timetables with polymorphic ejection chains , 2013, Annals of Operations Research.

[19]  Roman Barták,et al.  Minimal Perturbation Problem in Course Timetabling , 2004, PATAT.