Abstract
The study of the relationship and interaction between the work carried out in the academic literature and the requirements of university administrators is essential if ideas generated by research are to benefit every-day users. Conversely, it is crucial that the needs of the timetabling community influence the direction taken by research if high-quality practical solutions are to be produced. A main objective of the work presented here is to provide up-to-date information which will enable researchers to further investigate the area of timetabling research in relation to the generation of robust and flexible techniques which can cope with complexities experienced during implementation in ‘real world’ scenarios. Furthermore, although not discussed here in detail, it is essential, from a commercial perspective, that these developed leading edge techniques are incorporated and used within general applicable timetabling tools. The aim of this paper is to motivate the discussion required to bridge this timetabling gap by bringing timetabling research and educational requirements closer together.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abdullah, S., Ahmadi, S., Burke, E.K., Dror, M., McCollum, B.: A tabu based large neighbourhood search methodology for the capacitated examination timetabling problem. Journal of Operational Research Society (accepted for publication), Advance online publication (September 13, 2006) (to appear, 2007), doi:10.1057/palgrave.jors.2602258
Abdullah, S., Ahmadi, S., Burke, E.K., Dror, M.: Investigating Ahuja–Orlin’s large neighbourhood search approach for examination timetabling. OR Spectrum 29, 351–372 (2007)
Abdullah, S., Burke, E.K., McCollum, B.: An investigation of variable neighbourhood search for the course timetabling problem. In: 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, MISTA, New York, July 2005, pp. 413–427 (2005)
Abdullah, S., Burke, E.K., McCollum, B.: Using a randomised iterative improvement algorithm with composite neighbourhood structures for course timetabling. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W.J., Hartl, R.F., Reimann, M. (eds.) Springer Operations Research. Computer Science Interfaces Book Series, Springer, Berlin (2006)
Amintoosi, M., Haddadina, J.: Feature selection in a fuzzy student sectioning algorithm. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 147–160. Springer, Heidelberg (2005)
Amintoosi, M., Haddadnia, J.: Feature selection in a fuzzy student sectioning algorithm. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 147–160. Springer, Heidelberg (2005)
Asmuni, H., Burke, E.K., Garibaldi, J.M., McCollum, B.: Fuzzy multiple ordering criteria for examination timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 334–353. Springer, Heidelberg (2005)
Asmuni, H., Burke, E.K., Garibaldi, J.M., McCollum, B.: A novel fuzzy approach to evaluate the quality of examination timetabling. In: Burke, E.K., Rudová, H. (eds.) PATAT 2006. LNCS, vol. 3867, pp. 327–346. Springer, Heidelberg (2007)
Aubin, J., Ferland, J.A.: A large scale timetabling problem. Computers and Operations Research 16, 67–77 (1989)
Bardadym, V.A.: Computer aided school and timetabling: the new wave. In: Burke, E.K., Ross, P. (eds.) Practice and Theory of Automated Timetabling. LNCS, vol. 1153, pp. 22–45. Springer, Heidelberg (1996)
Beyrouthy, C., Burke, E.K., Landa-Silva, J., McCollum, B., McMullan, P., Parkes, A.J.: The teaching space allocation problem with splitting. In: Burke, E.K., Rudová, H. (eds.) PATAT 2006. LNCS, vol. 3867, pp. 228–247. Springer, Heidelberg (2007)
Beyrouthy, C., Burke, E.K., Landa-Silva, J., McCollum, B., McMullan, P., Parkes, A.J.: Understanding the role of UFOs within space allocation (Abstract). In: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Brno, August 2006, pp. 359–364 (2006)
Burke, E.K., Bykov, Y., Newall, J.P., Petrovic, S.: A time-predefined local search approach to exam timetabling problems. IIE Transactions 36, 509–528 (2004)
Burke, E.K., Bykov, Y., Petrovic, S.: A multi-criteria approach to examination timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 118–131. Springer, Heidelberg (2001)
Burke, E.K., Carter, M. (eds.): PATAT 1997. LNCS, vol. 1408. Springer, Heidelberg (1998)
Burke, E.K., De Causmaecker, P. (eds.): PATAT 2002. LNCS, vol. 2740. Springer, Heidelberg (2003)
Burke, E.K., De Causmaecker, P., Petrovic, S., Vanden Berghe, G.: Metaheuristics for handling time interval coverage constraints in nurse scheduling. Applied Artificial Intelligence 20, 743–766
Burke, E.K., De Causmaecker, P., Vanden Berghe, G., Van Landeghem, G.: The state of the art of nurse rostering. Journal of Scheduling 7, 441–499 (2004)
Burke, E.K., Eckersley, A., McCollum, B., Petrovic, S., Qu, R.: Identifying potential similarity measures between exam timetabling problem for a case based reasoning system. In: The 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, MISTA, Nottingham, August 2003, pp. 120–136 (2003)
Burke, E.K., Eckersley, A.J., McCollum, B., Petrovic, S., Qu, R.: Using simulated annealing to study behavior of various exam timetabling data sets. In: MIC 2003. 5th Meta-heuristics International Conference, Kyoto (August 2003)
Burke, E.K., Elliman, D.G., Ford, P.H., Weare, R.F.: Examination timetabling in British universities – a survey. In: Burke, E.K., Ross, P. (eds.) Practice and Theory of Automated Timetabling. LNCS, vol. 1153, pp. 76–90. Springer, Heidelberg (1996)
Burke, E., Erben, W. (eds.): PATAT 2000. LNCS, vol. 2079. Springer, Heidelberg (2001)
Burke, E.K., Kendall, G., McCollum, B., McMullan, P., Newall, J.: Optime: integrating research expertise with institutional requirements (Software demonstration). In: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Brno, August 2006, pp. 510–515 (2006)
Burke, E.K., Kendall, G., McCollum, B., McMullan, P., Newall, J.: A preference based measurement of optimization. Internal eventMAP Technical Report eMAP/2006/02a
Burke, E.K., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyper-heuristics: an emerging direction in modern search technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Meta-Heuristics, ch. 16, pp. 457–474. Kluwer, Dordrecht (2003)
Burke, E.K., Kendall, G., Soubeiga, E.: A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics 9, 451–470 (2003)
Burke, E.K., Kingston, J.H., de Werra, D.: Applications to timetabling. In: Gross, J., Yellen, J. (eds.) The Handbook of Graph Theory, pp. 445–474. Chapman and Hall/CRC Press, Boca Raton, FL (2004)
Burke, E.K., Kingston, J., Pepper, P.: A standard data format for timetabling instances. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 213–223. Springer, Heidelberg (1998)
Burke, E.K., Landa Silva, J.D.: The influence of the fitness evaluation method on the performance of multiobjective optimisers. European Journal of Operational Research 169, 875–897 (2006)
Burke, E.K., McCollum, B., McMullan, P.: Examination timetabling: a new formulation (Abstract). In: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Brno, pp. 373–375 (August 2006)
Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyper heuristic for educational timetabling problems. European Journal of Operational Research 176, 177–192 (2007)
Burke, E.K., Newall, J.P.: A multi-stage evolutionary algorithm for the timetable problem. IEEE Transactions on Evolutionary Computation 3.1, 63–74 (1999)
Burke, E.K., Newall, J.: Enhancing timetable solutions with local search methods. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 195–206. Springer, Heidelberg (2003)
Burke, E.K., Newall, J.P.: Solving examination timetabling problems through adaptation of heuristic orderings. Annals of Operations Research 129, 107–134 (2004)
Burke, E.K., Newall, J.P., Weare, R.F.: A memetic algorithm for university exam timetabling. In: Burke, E.K., Ross, P. (eds.) Practice and Theory of Automated Timetabling. LNCS, vol. 1153, pp. 241–250. Springer, Heidelberg (1996)
Burke, E.K., Newall, J., Weare, R.F.: A simple heuristically guided search for the timetable problem. In: Alpaydin, E., Fyte, C. (eds.) EIS 1998. Proceedings of the International ICSC Symposium on Engineering of Intelligent Systems, University of La Laguna, Spain, pp. 574–579. Academic, New York (1998)
Burke, E.K., Petrovic, S.: Recent research directions in automated timetabling. European Journal of Operational Research 140, 266–280 (2002)
Burke, E.K., Petrovic, S., Qu, R.: Case based heuristic selection for timetabling problems. Journal of Scheduling 9, 99–113 (2006)
Burke, E.K., Ross, P. (eds.): Practice and Theory of Automated Timetabling. LNCS, vol. 1153. Springer, Heidelberg (1996)
Burke, E.K., Trick, M.A. (eds.): PATAT 2004. LNCS, vol. 3616. Springer, Heidelberg (2005)
Carter, M.W.: A comprehensive course timetabling and student scheduling system at the University of Waterloo. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 64–84. Springer, Heidelberg (2001)
Carter, M.W., Laporte, G.: Recent developments in practical course timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 3–19. Springer, Heidelberg (1998)
Chand, A.: A constraint based generic model for representing complete university timetabling data. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 125–150. Springer, Heidelberg (2005)
Colorni, A., Dorigo, M., Maniezzo, V.: Metaheuristics for high school timetabling. Computational Optimisation and Applications 9, 275–298 (1998)
Corne, D.W., Kingston, J.: Addressing the availability-based laboratory/tutorial timetabling problem with heuristics and metaheuristics. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 136–140. Springer, Heidelberg (2003)
Cumming, A., Paechter, B., Rankin, R.C.: Post-publication timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 107–108. Springer, Heidelberg (2001)
Deb, K., Pratap, A., Agarwal, S., Meyrivan, T.: A fast and elitist multi-objective genetic algorithm. IEEE Transactions on Evolutionary Computation 6, 182–197 (2002)
Dimopoulou, M., Miliotis, P.: Implementing a university course and examination timetabling system in a distributed environment. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 148–151. Springer, Heidelberg (2001)
EPSRC/ESRC Document Review of Research Status of Operational Research in the UK (2004)
Geller, S.: Timetabling at the University of Sheffield, UK – hardening the incremental approach to timetable development. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 499–500. Springer, Heidelberg (2005)
HEFCE: Estates management statistics project. Technical Report. Higher Education Funding Council for England (March 1999), Report 99/18. http://www.hefce.ac.uk/pubs/hefce/1999/99_18.htm
Kingston, J.H., Yin-Sun Kynn, B.: A software architecture for timetable construction. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 342–350. Springer, Heidelberg (2001)
Konstantinow, G., Coakley, C.: Use of genetic algorithms in reactive scheduling for course timetable adjustments. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 521–522. Springer, Heidelberg (2005)
Laporte, G., Desroches, S.: The problem of assigning students to course section in a large engineering school. Computers and Operations Research 13, 387–394 (1986)
McCollum, B.: The implementation of a centrally computerised timetabling system in a large British civic university. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 237–254. Springer, Heidelberg (1998)
McCollum, B.: 2003–2004 Academic timetabling: analysis of staff and student perception. Internal eventMAP Report eMAP04/02/01
McCollum, B.: Bridging the gap between research and practice: university timetabling in the real world – KEYNOTE. In: Proceedings of the 47th Annual Operational Society Conference, OR47, Chester (September 2005)
McCollum, B., McKillop, M., McMullan, P.: Course scheduling: the division of lecture events into tutorials. Internal eventMAP Technical Report eMAP/2006/02b
McCollum, B., McMullan, P., Newall, J., Lane, J.P.: A workable scheduling algorithm. In: The 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, MISTA, Nottingham, pp. 570–572 (August 2003)
McCollum, B., Newall, J.: Introducing Optime: Examination Timetabling Software. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 485–490. Springer, Heidelberg (2001)
Merlot, L.T.G., Borland, N., Hughes, B.D., Stuckey, P.J.: A hybrid algorithm for the examination timetabling problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 207–231. Springer, Heidelberg (2003)
Muller, T., Barak, R.: Interactive timetabling: concepts, techniques and practical results. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 58–72. Springer, Heidelberg (2003)
Muller, T., Rudova, H., Bartak, R.: Minimal perturbation problem in course timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 126–146. Springer, Heidelberg (2005)
Ozan, E., Alkan, A.: Timetabling using a steady state genetic algorithm. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 104–106. Springer, Heidelberg (2003)
Paquete, L., Stützle, T.: Empirical analysis of tabu search for the lexicographic optimisation of the examination timetabling problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 413–420. Springer, Heidelberg (2003)
Petrovic, S., Burke, E.K.: Educational timetabling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, pp. 45-1–45-23. Chapman and Hall/CRC Press, Boca Raton, FL (2004)
Petrovic, S., Bykov, Y.: A multiobjective optimisation technique for exam timetabling based on trajectories. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 179–192. Springer, Heidelberg (2003)
Petrovic, S., Patel, V., Yang, Y.: Examination timetabling with fuzzy constraints. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 313–333. Springer, Heidelberg (2005)
Piechowiak, A., Ma, J., Mandiau, R.: An open interactive timetabling tool. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 34–50. Springer, Heidelberg (2005)
Qu, R., Burke, E.K., McCollum, B., Merlot, L.G.T., Lee, S.Y.: The state of the art of examination timetabling. Technical Report NOTTCS-TR-2006-4, School of CSiT, University of Nottingham
Reis, L.P., Oliveira, E.: A language for specifying complete timetable problems. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 322–341. Springer, Heidelberg (2003)
Rossi-Doria, O., Samples, M., Birattari, M., Chiarandini, M., Dorigo, M., Gambardella, M., Knowles, J., Manfrin, M., Mastrolilli, M., Paechter, B., Paquete, L., Stutzle, T.: A comparison of the performance of different metaheuristics on the timetabling problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 329–351. Springer, Heidelberg (2003)
Rubio, R.G., Munoz, D.P.: A timetable production system architecture for course and exams. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 567–570. Springer, Heidelberg (2005)
Schaerf, A.: A survey of automated timetabling. Artificial Intelligence Review 13, 87–127 (1999)
Socha, K., Knowles, J., Samples, M.: A max–min ant system for the university course timetabling problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms. LNCS, vol. 2463, pp. 1–13. Springer, Heidelberg (2002)
Thompson, J., Dowsland, K.: A robust simulated annealing based examination timetabling system. Computers Operations Research 25, 637–648 (1998)
The Times Higher Educational Supplement, 4 (March 10, 2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McCollum, B. (2007). A Perspective on Bridging the Gap Between Theory and Practice in University Timetabling. In: Burke, E.K., Rudová, H. (eds) Practice and Theory of Automated Timetabling VI. PATAT 2006. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77345-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-77345-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77344-3
Online ISBN: 978-3-540-77345-0
eBook Packages: Computer ScienceComputer Science (R0)
