A variant of examination timetabling problem

The examination timetabling problem is a typical combinatorial optimization problem. In literature, heuristic methods are usually chosen to solve these problems, and mathematical programming approaches have not been well developed. This paper raises a variant of exam timetabling, with multiple exam paper versions, which comes from real-world applications. The mathematical formulation is presented, and further refined under assumptions to make it solvable for large-scale problems. Then, a preprocessing procedure, called ldquogroup-and-dividerdquo, is introduced to improve the solution quality by reducing the size of the input data. In addition, the symmetry of the model is studied, and a set of constraints are added to break the strong symmetry existing in the model. Real data are tested using CPLEX solver, and the results show that our approach is effective and applicable for real-world problems.

[1]  David Johnson.  Timetabling University Examinations , 1990 .

[2]  Philippe David.  A Constraint-Based Approach for Examination Timetabling Using Local Repair Techniques , 1997, PATAT.

[3]  Edmund K. Burke,et al.  A survey of search methodologies and automated system development for examination timetabling , 2009, J. Sched..

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

[5]  Nagraj Balakrishnan,et al.  Scheduling examinations to reduce second-order conflicts , 1992, Comput. Oper. Res..

[6]  Hanif D. Sherali,et al.  Improving Discrete Model Representations via Symmetry Considerations , 2001, Manag. Sci..

[7]  Edmund K. Burke,et al.  A Genetic Algorithm Based University Timetabling System , 1994 .

[8]  Arabinda Tripathy.  A Lagrangean Relaxation Approach to Course Timetabling , 1980 .

[9]  Luca Di Gaspero,et al.  Tabu Search Techniques for Examination Timetabling , 2000, PATAT.

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

[11]  Michael W. Carter,et al.  OR Practice - A Survey of Practical Applications of Examination Timetabling Algorithms , 1986, Oper. Res..

[12]  A. Hertz.  Tabu search for large scale timetabling problems , 1991 .

[13]  Meinolf Sellmann,et al.  Symmetry Breaking , 2001, CP.

[14]  Laurent Péridy,et al.  Constraint Logic Programming for Examination Timetabling , 1996, J. Log. Program..

[15]  A. Tripathy.  School Timetabling---A Case in Large Binary Integer Linear Programming , 1984 .

[16]  Gilbert Laporte,et al.  Recent Developments in Practical Examination Timetabling , 1995, PATAT.

[17]  Kathryn A. Dowsland,et al.  General Cooling Schedules for a Simulated Annealing Based Timetabling System , 1995, PATAT.

[18]  G. Nemhauser,et al.  Integer Programming , 2020 .

[19]  D. de Werra,et al.  The combinatorics of timetabling , 1997 .

[20]  Jonathan L. Gross,et al.  Handbook of graph theory , 2007, Discrete mathematics and its applications.