An overview of curriculum-based course timetabling

In 2007, the Second International Timetabling Competition (ITC-2007) has been organized and a formal definition of the Curriculum-Based Course Timetabling (CB-CTT) problem has been given, by taking into account several real-world constraints and objectives while keeping the problem general. CB-CTT consists of finding the best weekly assignment of university course lectures to rooms and time periods. A feasible schedule must satisfy a set of hard constraints and must also take into account a set of soft constraints, whose violation produces penalty terms to be minimized in the objective function. From ITC-2007, many researchers have developed advanced models and methods to solve CB-CTT. This survey is devoted to review the main works on the topic, with focus on mathematical models, lower bounds, and exact and heuristic algorithms. Besides giving an overview of these approaches, we highlight interesting extensions that could make the study of CB-CTT even more challenging and closer to reality.

[1]  George Goulas,et al.  Solving the Examination Timetabling Problem in GPUs , 2014, Algorithms.

[2]  Kate Smith-Miles,et al.  Generating Applicable Synthetic Instances for Branch Problems , 2013, Oper. Res..

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

[4]  Marco E. Lübbecke,et al.  Curriculum based course timetabling: new solutions to Udine benchmark instances , 2012, Ann. Oper. Res..

[5]  Kate Smith-Miles,et al.  Pitfalls in Instance Generation for Udine Timetabling , 2010, LION.

[6]  Efthymios Housos,et al.  An integer programming formulation for a case study in university timetabling , 2004, Eur. J. Oper. Res..

[7]  Edmund K. Burke,et al.  Automated University Timetabling: The State of the Art , 1997, Comput. J..

[8]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling III , 2001, Lecture Notes in Computer Science.

[9]  Jaime Miranda.  eClasSkeduler: A Course Scheduling System for the Executive Education Unit at the Universidad de Chile , 2010, Interfaces.

[10]  Robert Nieuwenhuis,et al.  Curriculum-based course timetabling with SAT and MaxSAT , 2012, Ann. Oper. Res..

[11]  Philipp Kostuch,et al.  The University Course Timetabling Problem with a Three-Phase Approach , 2004, PATAT.

[12]  Pierre Hansen,et al.  Bounded vertex colorings of graphs , 1990, Discret. Math..

[13]  Ben Paechter,et al.  Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition , 2010, INFORMS J. Comput..

[14]  Luca Di Gaspero,et al.  Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems , 2006, J. Math. Model. Algorithms.

[15]  Zulkifli Ahmad,et al.  A hybrid simulated annealing with solutions memory for curriculum-based course timetabling problem , 2013 .

[16]  Wojciech Bozejko,et al.  Solving Timetabling Problems on GPU , 2014, ICAISC.

[17]  Seyyed Ali MirHassani,et al.  Solution approaches to the course timetabling problem , 2011, Artificial Intelligence Review.

[18]  Barry McCollum,et al.  University Timetabling: Bridging the Gap between Research and Practice , 2006 .

[19]  Jens Gottlieb,et al.  Evolutionary Computation in Combinatorial Optimization , 2006, Lecture Notes in Computer Science.

[20]  Mauro Birattari,et al.  An effective hybrid algorithm for university course timetabling , 2006, J. Sched..

[21]  Jin-Kao Hao,et al.  Lower bounds for the ITC-2007 curriculum-based course timetabling problem , 2011, Eur. J. Oper. Res..

[22]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[23]  Jin-Kao Hao,et al.  Adaptive Tabu Search for course timetabling , 2010, Eur. J. Oper. Res..

[24]  Fred W. Glover,et al.  Neighborhood analysis: a case study on curriculum-based course timetabling , 2011, J. Heuristics.

[25]  D. Landa-Silva,et al.  Great deluge with non-linear decay rate for solving course timetabling problems , 2008, 2008 4th International IEEE Conference Intelligent Systems.

[26]  Richard F. Hartl,et al.  Adaptive large neighborhood search for the curriculum-based course timetabling problem , 2016, Annals of Operations Research.

[27]  Salwani Abdullah,et al.  Hybridizing Meta-heuristics Approaches for Solving University Course Timetabling Problems , 2013, RSKT.

[28]  Simon Kristiansen,et al.  A Comprehensive Study of Educational Timetabling - a Survey , 2013 .

[29]  Edmund K. Burke,et al.  A branch-and-cut procedure for the Udine Course Timetabling problem , 2012, Ann. Oper. Res..

[30]  Sanja Petrovic,et al.  An Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling , 2004, Metaheuristics for Multiobjective Optimisation.

[31]  Jaber Karimpour,et al.  A survey of approaches for university course timetabling problem , 2015, Comput. Ind. Eng..

[32]  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 , 2005, PATAT.

[33]  Sophia Daskalaki,et al.  Efficient solutions for a university timetabling problem through integer programming , 2005, Eur. J. Oper. Res..

[34]  Edmund K. Burke,et al.  Penalising Patterns in Timetables: Novel Integer Programming Formulations , 2007, OR.

[35]  Edmund K. Burke,et al.  The practice and theory of automated timetabling , 2014, Ann. Oper. Res..

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

[37]  Michael W. Carter.  A Comprehensive Course Timetabling and Student Scheduling System at the University of Waterloo , 2000, PATAT.

[38]  Edmund K. Burke,et al.  Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem , 2007, Metaheuristics.

[39]  Katsumi Inoue,et al.  Answer set programming as a modeling language for course timetabling , 2013, Theory Pract. Log. Program..

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

[41]  Anthony Wren,et al.  Scheduling, Timetabling and Rostering - A Special Relationship? , 1995, PATAT.

[42]  Martin Josef Geiger,et al.  Multi-criteria Curriculum-Based Course Timetabling-A Comparison of a Weighted Sum and a Reference Point Based Approach , 2009, EMO.

[43]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[44]  Edmund K. Burke,et al.  Decomposition, reformulation, and diving in university course timetabling , 2009, Comput. Oper. Res..

[45]  Salwani Abdullah,et al.  On the use of multi neighbourhood structures within a Tabu-based memetic approach to university timetabling problems , 2012, Inf. Sci..

[46]  Gerhard J. Woeginger,et al.  Timetabling problems at the TU Eindhoven , 2009, Eur. J. Oper. Res..

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

[48]  Jeroen Belien,et al.  Building university course timetables with minimized resulting student flows , 2013 .

[49]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling IV , 2002, Lecture Notes in Computer Science.

[50]  Igor Vasil'ev,et al.  A Computational Study of a Cutting Plane Algorithm for University Course Timetabling , 2005, J. Sched..

[51]  Sara Ceschia,et al.  Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem , 2014, Comput. Oper. Res..

[52]  Jin-Kao Hao,et al.  A Critical Element-Guided Perturbation Strategy for Iterated Local Search , 2009, EvoCOP.

[53]  Hanif D. Sherali,et al.  A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations , 2007, Eur. J. Oper. Res..

[54]  Luca Di Gaspero,et al.  Multi-neighbourhood Local Search with Application to Course Timetabling , 2002, PATAT.

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

[56]  Ben Paechter,et al.  Metaheuristics for University Course Timetabling , 2007, Evolutionary Scheduling.

[57]  Keith S. Murray,et al.  Comprehensive approach to student sectioning , 2010, Ann. Oper. Res..

[58]  Tomás Müller,et al.  ITC2007 solver description: a hybrid approach , 2009, Ann. Oper. Res..

[59]  Luca Di Gaspero,et al.  Design and statistical analysis of a hybrid local search algorithm for course timetabling , 2012, J. Sched..

[60]  Saul I. Gass,et al.  Encyclopedia of Operations Research and Management Science , 1997 .

[61]  Nelishia Pillay,et al.  A review of hyper-heuristics for educational timetabling , 2016, Ann. Oper. Res..

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

[63]  S. A. MirHassani.  A computational approach to enhancing course timetabling with integer programming , 2006, Appl. Math. Comput..

[64]  Paolo Toth,et al.  A new lower bound for curriculum-based course timetabling , 2013, Comput. Oper. Res..

[65]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling VI, 6th International Conference, PATAT 2006, Brno, Czech Republic, August 30 - September 1, 2006, Revised Selected Papers , 2007, PATAT.

[66]  Rolf Wanka,et al.  Fairness in academic course timetabling , 2013, Annals of Operations Research.

[67]  Martin Josef Geiger,et al.  Applying the threshold accepting metaheuristic to curriculum based course timetabling , 2012, Ann. Oper. Res..

[68]  Edmund K. Burke,et al.  On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling , 2007, ArXiv.

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

[70]  Marco E. Lübbecke,et al.  Optimal University Course Timetables and the Partial Transversal Polytope , 2008, WEA.

[71]  Edmund K. Burke,et al.  A supernodal formulation of vertex colouring with applications in course timetabling , 2007, Ann. Oper. Res..