Bibliography on Exam Timetabling Problems (1995-)

Home

Bibliography on Exam Timetabling (1995-)

R. Qu, E. K. Burke, B. McCollum, L.T.G. Merlot, and S.Y. Lee. A Survey of Search Methodologies and Automated System Development for Examination Timetabling. Journal of Scheduling, 12(1): 55-89, 2009. online publication Oct 2008. doi: 10.1007/s10951-008-0077-5. .pdf

Surveys

J.H. Kingston. (1995). Bibliography on practice and theory of automated timetabling. Available at: http://liinwww.ira.uka.de/bibliography/Misc/timetabling.html

R. Miles. (1975). Computer timetabling: A bibliography. British Journal of Educational Technology. 6(3): 16-20.

E.A. Schmidt, T. Strohlein. (1979) Timetable construction - An annotated bibliography. The Computer Journal, 23: 307-316.

M.W. Carter. (1986). A survey of practical applications of examination timetabling algorithms. OR, 34(2): 193-202.

M.W. Carter and G. Laporte. (1996). Recent developments in practical examination timetabling. In: E.K. Burke and P. Ross (eds). (1996). Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference. LNCS 1153. Springer-Verlag, Berlin, Heidelberg, 1996. 3-21.

E.K. Burke, D.G. Elliman, P.H. Ford and R.F. Weare. (1996). Examination timetabling in British universities: A survey. In: E.K. Burke and P. Ross (eds). (1996). Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference. LNCS 1153. Springer-Verlag, Berlin, Heidelberg, 1996. 76-90.

E.K. Burke, K. Jackson, J.H. Kingston and R. Weare. (1997). Automated university timetabling: The state of the art. The Computer Journal, 40(9): 565-571.

V.A. Bardadym. (1996). Computer-aided school and university timetabling: The new wave. In: E.K. Burke and P. Ross (eds). (1996). Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference. LNCS 1153. Springer-Verlag, Berlin, Heidelberg, 1996. 22-45.

A. Wren. (1996). Scheduling, timetabling and rostering - A special relationship? In: E.K. Burke and P. Ross (eds). (1996). Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference. LNCS 1153. Springer-Verlag, Berlin, Heidelberg, 1996. 46-75.

A. Schaerf. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2): 87-127.

E.K. Burke and S. Petrovic. (2002). Recent research directions in automated timetabling. EJOR, 140(2): 266-280.

S. Petrovic and E.K. Burke. (2004). Chapter 45: University timetabling. In: J. Leung (ed): Handbook of Scheduling: Algorithms, Models, and Performance Analysis, CRC Press, April 2004.

E.K. Burke, J.H. Kingston and D. de Werra. (2004). Applications to timetabling. In: J. Gross and J. Yellen (eds.) The Handbook of Graph Theory, Chapman Hall/CRC Press, 2004, 445-474.

Graph Based Sequential Techniques

M.W. Carter, G. Laporte and S.Y. Lee. (1996). Examination timetabling: Algorithmic strategies and applications. JORS, 47(3): 373-383.

M.W. Carter and D.G. Johnson. (2001). Extended clique initialisation in examination timetabling. JORS, 52: 538-544.

E.K. Burke, J.P. Newall and R.F. Weare. (1998). A simple heuristically guided search for the timetable problem. In: Proceedings of the International ICSC Symposium on Engineering of Intelligent Systems (EIS98), 574-579.

E.K. Burke and J.P. Newall. (2004). Solving examination timetabling problems through adaptation of heuristic orderings. Annals of OR, 129: 107-134.

E.K. Burke and J.P. Newall. (1999) A multi-stage evolutionary algorithm for the timetable problem. IEEE Transactions on Evolutionary Computation, 3(1): 63-74.

Constraint Based Techniques

P. David. A constraint-based approach for examination timetabling using local repair techniques. In: E.K. Burke and M.W. Carter (eds). (1998). Practice and Theory of Automated Timetabling: Selected Papers from the 2nd International Conference. LNCS 1408. Springer-Verlag, Berlin, Heidelberg, 1998. 169-186.

L.P. Reis and E. Oliveira. (1999). Constraint logic programming using set variables for solving timetabling problems. 12th International Conference on Applications of Prolog.

L.T.G. Merlot, N. Boland, B.D. Hughes and P.J. Stuckey. (2003). A hybrid algorithm for the examination timetabling problem. In: E.K. Burke and P. De Causmaecker (eds). (2003). Practice and Theory of Automated Timetabling: Selected Papers from the 4th International Conference. LNCS 2740. Springer-Verlag, Berlin, Heidelberg, 2003. 207-231.

T.A. Duong, K.H. Lam (2004). Combining constraint programming and simulated annealing on university exam timetabling. In: Proceedings of RIVF 2004 Conference, Hanoi, Vietnam, February 2-5, 2004, 205-210.

Tabu Search

L. Di Gaspero and A. Schaerf. (2001). Tabu search techniques for examination timetabling. In: E.K. Burke and W. Erben (eds). (2001). Practice and Theory of Automated Timetabling: Selected Papers from the 3rd International Conference. LNCS 2079. Springer-Verlag, Berlin, Heidelberg, 2001. 104-117.

L. Di Gaspero. (2002). Recolour, shake and kick: A recipe for the examination timetabling problem. In: E.K. Burke and P. De Causmaecker (eds). (2002). Proceedings of the 4th International Conference on Practice and Theory of Automated Timetabling. 21st-23rd August 2002. KaHo St.-Lieven, Gent, Belgium. 404-407.

G.M. White and B.S. Xie. (2001). Examination timetables and tabu search with longer-term memory. In: E.K. Burke and W. Erben (eds). (2001). Practice and Theory of Automated Timetabling: Selected Papers from the 3rd International Conference. LNCS 2079. Springer-Verlag, Berlin, Heidelberg, 2001. 85-103.

G.M. White, B.S. Xie, and S. Zonjic. (2004). Using tabu search with longer-term memory and relaxation to create examination timetables. EJOR, 153(16): 80-91.

L. Paquete and T. Stutzle. (2002). Empirical analysis of tabu search for the lexicographic optimization of the examination timetabling problem. In: E.K. Burke and P. De Causmaecker (eds). (2002). Proceedings of the 4th International Conference on Practice and Theory of Automated Timetabling. 21st-23rd August 2002. KaHo St.-Lieven, Gent, Belgium. 413-420.

Simulated Annealing

J. Thompson and K. Dowsland. (1998). A robust simulated annealing based examination timetabling system. Computer & Operations Research, 25, 637-648.

B. Bullnheimer. (1998) An examination scheduling model to maximize students study time. In: E.K. Burke and M.W. Carter (eds). (1998). Practice and Theory of Automated Timetabling: Selected Papers from the 2nd International Conference. LNCS 1408. Springer-Verlag, Berlin, Heidelberg, 1998. 78-91.

E.K. Burke, Y. Bykov, J.P. Newall, and S. Petrovic. (2004). A time-predefined local search approach to exam timetabling problems. IIE Transactions on Operations Engineering, 36(6): 509-528.

Other Local Search Based Techniques

M. Caramia, P. DellOlmo and G.F. Italiano. (2001). New algorithms for examination timetabling. In: S. Naher and D. Wagner (eds): Algorithm Engineering 4th International Workshop, Proceedings WAE 2000. LNCS 1982, Springer-Verlag, Berlin, 230-241.

S. Ahmadi, R. Barrone, P. Cheng, P. Cowling and B. McCollum. (2003). Perturbation based variable neighbourhood search in heuristic space for examination timetabling problem. In: Proceedings of MISTA 2003, Nottingham, August 13-16, 2003, 155-171.

S. Casey and J. Thompson. (2003). GRASPing the examination scheduling problem. In: E.K. Burke and P. De Causmaecker (eds). (2003). Practice and Theory of Automated Timetabling: Selected Papers from the 4th International Conference. LNCS 2740. Springer-Verlag, Berlin, Heidelberg, 2003. 232-244.

S. Abdullah, S. Ahmadi, E.K. Burke and M. Dror. (2004). Investigating Ahuja-Orlins large neighbourhood search for examination timetabling. University of Nottingham Technical Report NOTTCS-TR-2004-8.

R. Qu and E.K. Burke. (2005). Analysing high level heuristics within a graph-based hyper heuristic for exam timetabling problems. Technical Report NOTTCS-TR-2005-3, School of Computer Science and IT, University of Nottingham.

Evolutionary Algorithms

P. Ross, D. Corne, H. Terashima-Marin. (1996). The phase transition niche for evolutionary algorithms in timetabling. In: E.K. Burke and P. Ross (eds). (1996). Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference. LNCS 1153. Springer-Verlag, Berlin, Heidelberg, 1996. 309-324.

P. Ross, E. Hart and D. Corne. (1998). Some observations about GA-based exam timetabling. In: E.K. Burke and M.W. Carter (eds). (1998). Practice and Theory of Automated Timetabling: Selected Papers from the 2nd International Conference. LNCS 1408. Springer-Verlag, Berlin, Heidelberg, 1998. 115-129.

H. Terashima-Marin, P. Ross and M. Valenzuela-Rendon. (1999). Clique-based crossover for solving the timetabling problem with GAs. In: M. Schoenauer et al (eds.): Proceedings of CEC 99 Conference. Washington: IEEE Press.

H. Terashima-Marin, P. Ross and M. Valenzuela-Rendon. (1999). Application of the hardness theory when solving the timetabling problem with GAs. Proceedings of the Congress on Evolutionary Computation 1999. Washington, D.C. 604-611.

H. Terashima-Marin, P. Ross and M. Valenzuela-Rendon. (1999). Evolution of constraint satisfaction strategies in examination timetabling. In: Proceedings of the Genetic and Evolutionary Conference, Orlando, Florida, 635-642.

L. Paquete and C.M. Fonseca. (2001). A study of examination timetabling with multiobjective evolutionary algorithm. In: Proceedings of the 4th Meta-heuristics International Conference (MIC 2001), 149-154.

W. Erben. (2001). A grouping genetic algorithm for graph colouring and exam timetabling. In: E.K. Burke and W. Erben (eds). (2001). Practice and Theory of Automated Timetabling: Selected Papers from the 3rd International Conference. LNCS 2079. Springer-Verlag, Berlin, Heidelberg, 2001. 132-156.

W. Erben and P.Y. Song.(2004). A hybrid grouping genetic algorithm for examination timetabling. In: E.K. Burke and M. Trick (eds). (2004). Proceedings of The 5th International Conference on the Practice and Theory of Automated Timetabling. 18th-20th Aug, Pittsburgh, PA USA. 487-490.

K. Sheibani. (2002). An evolutionary approach for the examination timetabling problems. In: E.K. Burke and P. De Causmaecker (eds). (2002). Proceedings of the 4th International Conference on Practice and Theory of Automated Timetabling. 21st-23rd August 2002. KaHo St.-Lieven, Gent, Belgium. 387-396.

T. Wong, P. Cote and P. Gely. (2002). Final exam timetabling: a practical approach. IEEE Canadian Conference on Electrical and Computer Engineering (CCECE 2002). Volume: 2, 726- 731.

P. Cote, T. Wong and R. Sabouri. (2005). Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem. In: E.K. Burke and M. Trick (eds). (2005). Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling. to appear in LNCS. 151-168.

T.A. Gani, A.T. Khader and R. Budiarto. (2004). Optimizing examination timetabling using a hybrid evolution strategies. 2nd International Conference on Autonomous Robots and Agents. Dec 2004, New Zealand.

E.K. Burke, J.P. Newall and R.F. Weare. (1996). A memetic algorithm for university exam timetabling. In: E.K. Burke and P. Ross (eds). (1996). Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference. LNCS 1153. Springer-Verlag, Berlin, Heidelberg, 1996. 241-250.

E.K. Burke, J.P. Newall and R.F. Weare. (1998). Initialization strategies and diversity in evolutionary timetabling. Evolutionary computation, 6(1): 81-103.

E.K. Burke and J.P. Newall. (1999) A multi-stage evolutionary algorithm for the timetable problem. IEEE Transactions on Evolutionary Computation, 3(1): 63-74.

N. Mansour, V. Isahakian, and I. Ghalayini (2009). Scatter search technique for exam timetabling. Applied Intelligence, DOI 10.1007/s10489-009-0196-5, Springer.

Ant Algorithms

Z. Naji Azimi. (2004). Comparison of metaheuristic algorithms for examination timetabling problem. Applied Mathematics and Computation, 16(1-2): 337-354.

Z. Naji Azimi. (2005). Hybrid heuristics for examination timetabling problem. Applied Mathematics and Computation. 163: 705-733.

K.A. Dowsland and J. Thompson. (2005). Ant colony optimization for the examination scheduling problem. JORS, 56: 426438.

Multi-Criteria and Multi-Stage Techniques

A.W. Colijn and C. Layfield. (1995). Conflict reduction in examination schedules. In: E.K. Burke and P. Ross (eds). (1995). Proceedings of the 1st International Conference on the Practice and Theory of Automated Timetabling. 30th Aug - 1st Sep 1995. Napier University, Edinburgh, UK. 297-307.

A.W. Colijn and C. Layfield. (1995). Interactive improvement of examination schedules. In: E.K. Burke and P. Ross (eds). (1995). Proceedings of the 1st International Conference on the Practice and Theory of Automated Timetabling. 30th Aug - 1st Sep 1995. Napier University, Edinburgh, UK. 112-121.

J. Thompson and K. Dowsland. (1996). Variants of simulated annealing for the examination timetabling problem. Annals of OR, 63: 105-128.

J. Thompson and K. Dowsland. (1998). A robust simulated annealing based examination timetabling system. Computer & Operations Research, 25, 637-648.

E.K. Burke, Y. Bykov and S. Petrovic. (2001). A multicriteria approach to examination timetabling. In: E.K. Burke and W. Erben (eds). (2001). Practice and Theory of Automated Timetabling: Selected Papers from the 3rd International Conference. LNCS 2079. Springer-Verlag, Berlin, Heidelberg, 2001. 118-131.

S. Petrovic and Y. Bykov. (2003). A multiobjective optimisation technique for exam timetabling based on trajectories. In: E.K. Burke and P. De Causmaecker (eds). (2003). Practice and Theory of Automated Timetabling: Selected Papers from the 4th International Conference. LNCS 2740. Springer-Verlag, Berlin, Heidelberg, 2003. 179-192.

G.M. White, B.S. Xie, and S. Zonjic. (2004). Using tabu search with longer-term memory and relaxation to create examination timetables. EJOR, 153(16): 80-91.

Burke E.K., Landa Silva J.D., Soubeiga E. (2005). Multi-objective Hyper-heuristic Approaches for Space Allocation and Timetabling, In: Ibaraki T., Nonobe K., Yagiura M. (eds.), Meta-heuristics: Progress as Real Problem Solvers, Selected Papers from the 5th Metaheuristics International Conference (MIC 2003), Springer, pp. 129-158.

Hyper-heuristics

S. Petrovic, Y. Yang and M. Dror. (2003). Case-based initialisation of meta-heuristics for examination timetabling. In: Proceedings of MISTA 2003, Nottingham, August 13-16, 137-154.

H. Asmuni, E.K. Burke and J. Garibaldi: (2004). Fuzzy multiple ordering criteria for examination timetabling. In: E.K. Burke and M. Trick (eds). (2005). Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling. to appear in LNCS.

G. Kendall and N. Mohd Hussin. (2004). Tabu search hyper-heuristic approach to the examination timetabling problem at MARA University of Technology. In: E.K. Burke and M. Trick (eds). (2005). Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling. to appear in LNCS. 199-218.

E.K. Burke, S. Petrovic and R. Qu. (2005). Case-based heuristic selection for timetabling problems. Accepted for publication in the Journal of Scheduling, 2005.

E.K. Burke, M. Dror, S. Petrovic and R. Qu. (2005). Hybrid graph heuristics in hyper-heuristics applied to exam timetabling problems. In: B.L. Golden, S. Raghavan and E.A. Wasil (eds.): The Next Wave in Computing, Optimization, and Decision Technologies. 79-91. Springer, Maryland, Jan 2005.

E.K. Burke, A. Meisels, S. Petrovic and R. Qu. (2005). A graph based hyper-heuristic for exam timetabling problems. Accepted by EJOR.

R. Qu and E.K. Burke. (2005). Hybrid variable neighbourhood hyper-heuristica for exam timetabling problems. Accepted by MIC 2005. 22th-26th Aug 2005, Vienna, Austria.

M.A.J McGreevy, B.G.C. McCollum, P.H. Corr and P.P. McMullan. (2004). A neural network based construction heuristic. In: E.K. Burke and M. Trick (eds). (2005). Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling. to appear in LNCS. 531-534.

Decomposition

E.K. Burke and J.P. Newall. (1999) A multi-stage evolutionary algorithm for the timetable problem. IEEE Transactions on Evolutionary Computation, 3(1): 63-74.

S.L.M. Lin. (2002). A broker algorithm for timetabling problem. In: E.K. Burke and P. De Causmaecker (eds). (2002). Proceedings of the 4th International Conference on Practice and Theory of Automated Timetabling. 21st-23rd August 2002. KaHo St.-Lieven, Gent, Belgium. 372-386.

E. Kaplansky, G. Kendall, A. Meisels and N. Hussin. (2004). Distributed examination timetabling. In: E.K. Burke and M. Trick (eds). (2004). Proceedings of The 5th International Conference on the Practice and Theory of Automated Timetabling. 18th-20th Aug, Pittsburgh, PA USA.

Timetabling Systems and Languages

M.P. Hansen and V. Lauersen and R.V.V. Vidal. (1995) Nationwide scheduling of examinations: lessons from experience. In: E.K. Burke and P. Ross (eds). (1995). Proceedings of the 1st International Conference on the Practice and Theory of Automated Timetabling. 30th Aug - 1st Sep 1995. Napier University, Edinburgh, UK. 468-473.

M.P. Hansen and R.V.V. Vidal. (1995). Planning of high school examinations in Denmark. EJOR, 87: 519-534.

A. Lim, A.J. Chin, H.W. Kit and W.C. Oon. (2000). A campus-wide university examination timetabling application. In: Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, 1020-1025.

W.K. Ho, A. Lim and W.C. Oon. (2001). Maximizing paper spread in examination timetabling using a vehicle routing method. In: Proceedings of 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI01), 359-366.

M. Dimopoulou and P. Miliotis. (2001). Implementation of a university course and examination timetabling system. EJOR, 130: 202-213.

R.G. Rubio and D.P. Munoz. (2004). A timetable production system architecture for courses and exams. In: E.K. Burke and M. Trick (eds). (2004). Proceedings of The 5th International Conference on the Practice and Theory of Automated Timetabling. 18th-20th Aug, Pittsburgh, PA USA. 567-570.

E.K. Burke, J. Kingston and P.A. Pepper. (1997) A standard data format for timetabling instances. In: E.K. Burke and M.W. Carter (eds). (1998). Practice and Theory of Automated Timetabling: Selected Papers from the 2nd International Conference. LNCS 1408. Springer-Verlag, Berlin, Heidelberg, 1998. 215-224.

E. Tsang, P. Mills and R. Williams. (1999). A computer aided constraint programming system. In: The 1st International Conference on The Practical Application of Constraint Technologies and Logic Programming (PACLP), 81-93.

L.P. Reis and E. Oliveira. (2000). A language for specifying complete timetabling problems. In: E.K. Burke and W. Erben (eds). (2001). Practice and Theory of Automated Timetabling: Selected Papers from the 3rd International Conference. LNCS 2079. Springer-Verlag, Berlin, Heidelberg, 2001. 322-341.

A. Schaerf and L. Di Gaspero. (2001). Local search techniques for educational timetabling problems. In Proceedings of the 6 th International Symposium on Operations Research in Slovenia. Slovenia, September 26-28, 2001.

P. De Causmaecker, Y. Lu, P. Demeester and G. Vander Berghe. (2002). Using web standards for timetabling. In: E.K. Burke and P. De Causmaecker (eds). (2002). Proceedings of the 4th International Conference on Practice and Theory of Automated Timetabling. 21st-23rd August 2002. KaHo St.-Lieven, Gent, Belgium. 238-257.

Models and Complexity Issues

D. de Werra. (1997). Restricted coloring models for timetabling. DMATH: Discrete Mathematics, 165/166: 161-170.

D. de Werra, A.S. Asratian and S. Durand. (2002). Complexity of some special types of timetabling problems. Journal of Scheduling, 5: 171-183.

A. Chand. (2004). A constraint based genetic model for representing complete university timetabling data. In: E.K. Burke and M. Trick (eds). (2005). Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling. to appear in LNCS. 125-150.

Last updated date 8/May/2005