Skip to main content
SpringerLink
Log in

Case-based heuristic selection for timetabling problems

  • Papers
  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solving the problem in hand. Knowledge discovery techniques are employed in two distinct scenarios. Firstly, we model the problem and the problem solving situations along with specific heuristics for those problems. Secondly, we refine the case base and discard cases which prove to be non-useful in solving new problems. Experimental results are presented and analyzed. It is shown that case based reasoning can act effectively as an intelligent approach to learn which heuristics work well for particular timetabling situations. We conclude by outlining and discussing potential research issues in this critical area of knowledge discovery for different difficult timetabling problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Amintoosi, M. and J. Haddadina, “Feature selection in a fuzzy student sectioning algorithm,” in Burke, E. K. and M. Trick, (eds.), The 5th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 3616, Springer-Verlag 2005, pp. 148–161.

  • Asmuni, H., E. K. Burke, and J. M. Garibaldi, “Fuzzy multiple ordering criteria for examination timetabling.” inBurke, E. K. and M. Trick, (eds.), The 5th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 3616, Springer-Verlag 2005, pp. 334–354.

  • Beddoe, G. and S. Petrovic, “Determining feature weights using a genetic algorithm in a case-based reasoning approach to personnel rostering,” Accepted for publication in the European Journal of Operational Research, (2005).

  • Burke, E. K. and M. Carter (eds.), The 2nd International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 1408. Springer-Verlag, 1998.

  • Burke, E. K. and P de Causmaecker (eds.), The 4th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 2740. Springer-Verlag, 2002.

  • Burke, E. K., P. De Causmaecker, G. Vanden Berghe, and H. Van Landeghem, “The state of the art of nurse rostering,” Journal of Scheduling, 7(6), 441–499, (2004a).

    Article  Google Scholar 

  • Burke, E. K., D. De Werra, and J. Kingston, “Applications to timetabling,” in J. Gross and J. Yellen (eds.), Handbook of Graph Theory. Chapman Hall/CRC Press 2004b, pp. 445–474.

  • Burke, E. K., M. Dror, S. Petrovic, and R. Qu, “Hybrid graph heuristics within a hyper-heuristic approach to exam timetabling problems,” in B.L. Golden, S. Raghavan, and E. A. Wasil (eds.), The Next Wave in Computing, Optimization, and Decision Technologies, Conference Volume of the 9th informs Computing Society Conference Springer 2005, pp. 79–91.

  • Burke, E. K., A. Eckersley, B. McCollum, S. Petrovic, and R. Qu, “Similarity measures for exam timetabling problem,” 1st Multidisciplinary Intl. Conf. on Scheduling: Theory and Applications, Nottingham, UK, Aug 13–16 2003a, Vol. 1, pp. 120–136,.

  • Burke, E. K. and W Erben (eds.), “The 3rd International Conference on the Practice and Theory of Automated Timetabling,” Lecture Notes in Computer Science 2079, Springer-Verlag 2000.

  • Burke, E. K., E. Hart, G. Kendall, J. Newall, P. Ross, and S. Schulenburg, “Hyper-heuristics: An emerging direction in modern search technology,” in F. Glover and G. Kochenberger (eds.), Handbook of Meta-Heuristics, Kluwer. pp. 457–474 2003b.

  • Burke, E. K., K. S. Jackson, J. H. Kingston, and R. F. Weare, “Automated timetabling: The sate of the art,” The Computer Journal, 40(9), 565–571 (1997).

    Article  Google Scholar 

  • Burke, E. K., G. Kendall, and E. Soubeiga, “A tabu-search hyperheuristic for timetabling and rostering,” Journal of Heuristics, 9(6), 451–470 (2003c).

    Article  Google Scholar 

  • Burke, E. K., B. L. MacCarthy, S. Petrovic, and R. Qu, “Structured cases in case-based reasoning-re-using and adapting cases for time-tabling problems,” Knowledge-Based Systems, 13(2–3), 159–165 (2000).

    Google Scholar 

  • Burke, E. K., B. L. MacCarthy, S. Petrovic, and R. Qu, “Case-based reasoning in course timetabling: an attribute graph approach,” in D. W. Aha and I. Watson (eds.), Case-Based Reasoning Research and Development, Lecture Notes in Artificial Intelligence 2080, 2001 pp. 90–104.

  • Burke, E. K., B. MacCarthy, S. Petrovic, and R. Qu, “Multiple-retrieval case-based reasoning for course timetabling problems,” Journal of the Operational Research Society, 57(2), 148–162 (2006a).

    Google Scholar 

  • Burke, E. K., B. MacCarthy, S. Petrovic, and R. Qu, “Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling,” in Burke, E. K. and P de Causmaecker (eds.), The 4th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 2740. Springer-Verlag, 2002 pp. 277–288.

  • Burke, E. K., B. McCollum, A. Meisels, S. Petrovic, and R. Qu, “A graph-based hyper heuristic for educational timetabling problems,” (to appear) in the European Journal of Operational Research (2006b).

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

    Article  Google Scholar 

  • Burke, E.K., J. Newall, and R. Weare, “A simple heuristically guided search for the timetabling problem,” in Proceedings of the International ICSC Symposium on Engineering of Intelligent Systems, 1998 pp. 574–579.

  • Burke, E. K. and S. Petrovic, “Recent research directions in automated timetabling,” European Journal of Operational Research, 140(2), 266–280 (2002).

    Article  Google Scholar 

  • Burke, E. K. and P. Ross, (eds.), The 1st international conference on the practice and theory of automated timetabling, Lecture Notes in Computer Science 1153, Springer-Verlag (1996).

  • Burke, E. K. and M. Trick, (eds.), The 5th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 3616, Springer-Verlag 2005.

  • Carrasco, M. P. and M. V. Pato, “A multiobjective genetic algorithm for the class/teacher timetabling problem,” in Burke, E. K. and P de Causmaecker (eds.), The 4th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 2740. Springer-Verlag, 2002, pp. 179–192.

  • Carter, M. W., “A lagrangian relaxation approach to the classroom assignment problem,” IFOR, 27(2), 230–246 (1986).

    Google Scholar 

  • Carter, M. W. and G. Laporte, “Recent developments in practical exam timetabling,” in Burke, E. K. and P. Ross, (eds.), The 1st international conference on the practice and theory of automated timetabling, Lecture Notes in Computer Science 1153, Springer-Verlag, (1996) pp. 3–21.

  • Carter, M. W. and G. Laporte, “Recent developments in practical course timetabling,” in Burke, E. K. and M. Carter (eds.), The 2nd International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 1408. Springer-Verlag, 1998, pp. 3–19.

  • Carter, M. W., G. Laporte and S. Y. Lee, “Examination timetabling: Algorithmic strategies and applications,” Journal of Operations Research Society, 74, 373–383 (1996).

    Google Scholar 

  • Chan, P. and G. Weil, “Cyclic staff scheduling using constraint logic programming,” in Burke, E. K. and W Erben (eds.), “The 3rd International Conference on the Practice and Theory of Automated Timetabling,” Lecture Notes in Computer Science 2079, Springer-Verlag 2000, pp. 159–175.

  • Colorni, A., M. Dorigo, and V. Maniezzo, “Metaheuristics for school timetabling,” Computational Optimisation and Applications, 9(3), 277–298 (1998).

    Google Scholar 

  • Costa, D., “A tabu search algorithm for computing an operational timetable,” European Journal of Operational Research, 76, 98–110 (1994).

    Article  Google Scholar 

  • Cunningham, P. and B. Smyth, “Case-based reasoning in scheduling: reusing solution components,” The International Journal of Production Research, 35, 2947–2961 (1997).

    Google Scholar 

  • Dorn, J., “Case-based reactive scheduling,” Technical Report CD-TR 95/75. Vienna University of Technology, Institut for Information Systems (1995).

  • Dowsland, K. A., “Off the peg or made to measure,” in Burke, E. K. and M. Carter (eds.), The 2nd International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 1408. Springer-Verlag, 1998, pp. 37–52 .

  • Easton, K., G. Nemhauser, and M. Tick, “Sports Scheduling,” in Leung JYT (ed.), Handbook of Scheduling, Chapter 52. CRC Press LLC (2004).

  • Erben, W., “A grouping genetic algorithm for graph coloring and exam timetabling,” in Burke, E. K. and W Erben (eds.), “The 3rd International Conference on the Practice and Theory of Automated Timetabling,” Lecture Notes in Computer Science 2079, Springer-Verlag 2000, pp. 132–158.

  • Fayyad, U., G. Piatetsky-Shapiro, P. Smyth, and R. (eds.), Uthurusamy, Advances in Knowledge Discovery and Data Mining, AAAI Press, Melo Park, CA (1996).

  • Foulds, L. R. and D. G. Johnson, “SlotManager: A microcomputer-based decision support system for university timetabling,” Decision Support Systems, 27, 307–381 (2000).

    Article  Google Scholar 

  • Gaspero, L. D. and A. Schaerf, “Tabu search techniques for examination timetabling,” in Burke, E. K. and W Erben (eds.), “The 3rd International Conference on the Practice and Theory of Automated Timetabling,” Lecture Notes in Computer Science 2079, Springer-Verlag 2000, pp. 104–117.

  • Han, L. and G. Kendall, “Investigation of a tabu assisted hyper-heuristic genetic algorithm,” in Proceedings of Congress on Evolutionary Computation (CEC2003), Vol. 3, 2003, 2230–2237.

  • Kendall, G. and N. M. Hussin, “An investigation of a tabu-search-based hyper-heuristic for examination timetabling,” in Kendall, G., E. Burke, S. Petrovic and M. Gendreau (eds.), Multidisciplinary Scheduling: Theory and Applications, Springer, USA (2005a).

    Google Scholar 

  • Kendall, G. and N.M. Hussin, “A tabu search hyper-heuristic approach to the examination timetabling problem at the MARA UNIVERSITY OF TECHNOLOGY,” in Burke, E. K. and M. Trick, (eds.), The 5th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 3616, Springer-Verlag 2005b, pp. 270–293.

  • Kolodner, J. L. and D. Leake, “A tutorial introduction to case-based reasoning,” in Leake, D. (ed.), Case-based Reasoning: Experiences, Lessons and Future Directions, AAAI Press, Menlo Park, CA (1996), pp. 31–65.

  • Kong, S. C. and L. F. Kwok, “A conceptual model of knowledge-based timetabling system,” Knowledge-Based Systems, 12, 81–93 (1999).

    Article  Google Scholar 

  • Leake, D. (ed.), Case-based Reasoning: Experiences, Lessons and Future Directions, AAAI Press, Menlo Park, CA (1996).

    Google Scholar 

  • MacCarthy, B. L. and P. Jou, “Case-based reasoning in scheduling,” in M. K. Khan and C. S. Wright, (eds.), in Proceedings of the Symposium on Advanced Manufacturing Processes, Systems and Techniques, (MEP Publications Ltd, 1996), 1996 pp. 211–218.

  • Mantaras, R. L. and E. Plaza,“Case-based reasoning: An overview,” Al Communications, 10, 21–29 (1997).

    Google Scholar 

  • T-Marin, H., P. Ross, and M. V-Rendon, “Evolution of constraint satisfaction strategies in examination timetabling,” in Proceedings of the Genetic and Evolutionary Computation Conference, 1999 pp. 635–642.

  • Miyashita, K. and K. Sycara, “CABINS: A framework of knowledge acquisition and iterative revision for schedule improvement and reactive repair,” Artificial Intelligence, 76, 377–426 (1995).

    Article  Google Scholar 

  • Petrovic, S. and E. K. Burke, “University timetabling,” in J. Y. T. Leung (ed.), Handbook of Scheduling, Chapter 45. CRC Press LLC (2004).

  • Petrovic, S., V. Patel, and Y. Yang, “Examination timetabling with fuzzy constraints,” in Burke, E. K. and M. Trick, (eds.), The 5th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 3616, Springer-Verlag 2005, pp. 313–333.

  • Reeves, C. R., “Modern heuristic techniques,” in V. J. R-Smith, I. H. Osman, C. R. Reeves and G. D. Smith (eds.), Modern Heuristic Search Methods, 1996 pp. 1–25.

  • Ross, P., “Hyper-heuristics,” in E. K. Burke and G. Kendall (eds.), Introductory Tutorials in Optimisation, Decision Support and Search Methodology, Chapter 17. Kluwer (2004).

  • Ross, P., E. Hart, and D. Corne, “Some observations about GA based timetabling,” in Burke, E. K. and M. Carter (eds.), The 2nd International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 1408. Springer-Verlag, 1998, pp. 115–229 .

  • Rattadilok, P., A. Gaw, and R. S. K. Kwan, “Distributed choice function hyper-heuristics for timetabling and scheduling,” in Burke, E. K. and M. Trick, (eds.), The 5th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 3616, Springer-Verlag 2005, 51–70.

  • Schaef, A., “A survey of automated timetabling,” Artificial Intelligence Review, 13, 87–127 (1999).

    Google Scholar 

  • Schmidt, G.,“ Case-based reasoning for production scheduling,” International Journal of Production Economics, 56–57, 537–546 (1998).

    Google Scholar 

  • Scott, S., R. Simpson, and R. Ward, “Combining case-based reasoning and constraint logic programming techniques for packaged nurse rostering systems,” in Proceedings of the 3rd UK Case-Based Reasoning Workshop, University of Manchester, U.K. 9 September (1997).

Download references

Author information

Authors and Affiliations

  1. Automated Scheduling Optimisation and Planning (ASAP) Group, School of Computer Science and Information Technology, Jubilee Campus, University of Nottingham, Nottingham, NG8 1BB, UK

    Edmund K. Burke, Sanja Petrovic & Rong Qu

Authors
  1. Edmund K. Burke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanja Petrovic
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rong Qu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rong Qu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burke, E.K., Petrovic, S. & Qu, R. Case-based heuristic selection for timetabling problems. J Sched 9, 115–132 (2006). https://doi.org/10.1007/s10951-006-6775-y

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-006-6775-y

Keywords

Search

Navigation