Automated University Timetabling: The State of the Art

Scheduling lectures or exams for universities is a large and complex task. There are many different departments and faculties, each with their own ideas about how and when their courses should be run. Furthermore, modularization means that students can take courses from a combination of several departments, possibly even in different faculties. Numerous university timetabling systems have been devised, and work is underway to create a standard which will enable objective performance comparisons. This paper briefly looks at various popular techniques and recent work on both exam and course scheduling around the world, and should serve as an introduction to the field.

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

[2]  V. Lotfi,et al.  A Three Phased Approach To Final Exam Scheduling , 1989 .

[3]  Edmund K. Burke,et al.  A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems , 1995, ICGA.

[4]  Peter Ross,et al.  Fast Practical Evolutionary Timetabling , 1994, Evolutionary Computing, AISB Workshop.

[5]  Gyuri Lajos.  Complete University Modular Timetabling Using Constraint Logic Programming , 1995, PATAT.

[6]  Laurent Péridy,et al.  A CLP Approach for Examination Planning , 1995, Constraint Processing, Selected Papers.

[7]  Kathryn A. Dowsland,et al.  Variants of simulated annealing for the examination timetabling problem , 1996, Ann. Oper. Res..

[8]  Alain Hertz,et al.  Finding a feasible course schedule using Tabu search , 1992, Discret. Appl. Math..

[9]  Jeffrey H. Kingston,et al.  The Complexity of Timetable Construction Problems , 1995, PATAT.

[10]  Stefan D. Bloomfield,et al.  Preferential Course Scheduling , 1979 .

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

[12]  George M. White,et al.  Investigations of a Constraint Logic Programming Approach to University Timetabling , 1995, PATAT.

[13]  George M. White,et al.  A logic approach to the resolution of constraints in timetabling , 1992 .

[14]  Patrice Boizumault,et al.  Building University Timetables Using Constraint Logic Programming , 1995, PATAT.

[15]  Victor A. Bardadym.  Computer-Aided School and University Timetabling: The New Wave , 1995, PATAT.

[16]  Patrice Boizumault,et al.  Efficient labeling and Constraint Relaxation for Solving Time Tabling Problems , 1994 .

[17]  Ben Paechter,et al.  Two solutions to the general timetable problem using evolutionary methods , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[18]  Bernardo Prida Romero,et al.  Examination Scheduling in a Large Engineering School: A Computer-Assisted Participative Procedure , 1982 .

[19]  Edmund K. Burke,et al.  Specialised Recombinative Operators for Timetabling Problems , 1995, Evolutionary Computing, AISB Workshop.

[20]  Edmund K. Burke,et al.  The Automation of the Timetabling Process in Higher Education , 1995 .

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

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

[23]  Ben Paechter,et al.  Extensions to a Memetic Timetabling System , 1995, PATAT.

[24]  Edmund K. Burke,et al.  A Memetic Algorithm for University Exam Timetabling , 1995, PATAT.

[25]  Stéphane Nègre,et al.  Three Methods Used to Solve an Examination Timetable Problem , 1995, PATAT.

[26]  Gilbert Laporte,et al.  A General Examination Scheduling System , 1992 .