A multi-stage IP-based heuristic for class timetabling and trainer rostering

We consider a timetabling and rostering problem involving periodic retraining of large numbers of employees at an Australian electricity distributor. This problem is different from traditional high school and university timetabling problems studied in the literature in several aspects. We propose a three-stage heuristic consisting of timetable generation, timetable improvement, and trainer rostering. Large-scale integer linear programming models for both the timetabling and the rostering components are proposed, and several unique operational constraints are discussed. We show that this solution approach is able to produce good solutions in practically acceptable time.

[1]  Rhyd Lewis,et al.  A survey of metaheuristic-based techniques for University Timetabling problems , 2007, OR Spectr..

[2]  Edmund K. Burke,et al.  A University Timetabling System Based on Graph Colouring and Constraint Manipulation , 1994 .

[3]  Graham Kendall,et al.  The examination timetabling problem at Universiti Malaysia Pahang: Comparison of a constructive heuristic with an existing software solution , 2010, Eur. J. Oper. Res..

[4]  Aldy Gunawan,et al.  A Hybrid Algorithm for the University Course Timetabling Problem , 2008 .

[5]  Nelishia Pillay,et al.  A survey of school timetabling research , 2014, Ann. Oper. Res..

[6]  Nagraj Balakrishnan,et al.  A network model for the rotating workforce scheduling problem , 1990, Networks.

[7]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[8]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[9]  Stefan Helber,et al.  Application of a real-world university-course timetabling model solved by integer programming , 2007, OR Spectr..

[10]  Christoph Helmberg,et al.  Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation , 2008, ATMOS.

[11]  Luciana S. Buriol,et al.  A fix-and-optimize heuristic for the high school timetabling problem , 2014, Comput. Oper. Res..

[12]  Xin Yao,et al.  A new simulated annealing algorithm , 1995, Int. J. Comput. Math..

[13]  E. A. Akkoyunlu.  A Linear Algorithm for Computing the Optimum University Timetable , 1973, Comput. J..

[14]  Andreas T. Ernst,et al.  Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..

[15]  Ender Özcan,et al.  Linear Linkage Encoding in Grouping Problems: Applications on Graph Coloring and Timetabling , 2006, PATAT.

[16]  Makoto Fukushima.  A Hybrid Algorithm for the University Course Timetabling Problems , 2010 .

[17]  Efthymios Housos,et al.  A column generation approach for the timetabling problem of Greek high schools , 2003, J. Oper. Res. Soc..

[18]  Dániel Marx,et al.  RAPH COLORING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING , 2022 .

[19]  Sanja Petrovic,et al.  Recent research directions in automated timetabling , 2002, Eur. J. Oper. Res..

[20]  Panagiotis Miliotis,et al.  Implementation of a university course and examination timetabling system , 2001, Eur. J. Oper. Res..

[21]  George B. Dantzig,et al.  Letter to the Editor - A Comment on Edie's "Traffic Delays at Toll Booths" , 1954, Oper. Res..

[22]  John Tartar,et al.  Graph coloring conditions for the existence of solutions to the timetable problem , 1974, CACM.

[23]  Gilbert Laporte,et al.  Examination Timetabling: Algorithmic Strategies and Applications , 1994 .

[24]  Nirbhay K. Mehta.  The Application of a Graph Coloring Method to an Examination Scheduling Problem , 1981 .

[25]  Michael W. Carter,et al.  When Is the Classroom Assignment Problem Hard? , 1992, Oper. Res..

[26]  Ulrich W. Thonemann,et al.  Optimizing simulated annealing schedules with genetic programming , 1996 .

[27]  Norman L. Lawrie.  An integer linear programming model of a school timetabling problem , 1969, Comput. J..

[28]  Andrea Qualizza,et al.  A Column Generation Scheme for Faculty Timetabling , 2004, PATAT.