A Tiling Algorithm for High School Timetabling

  • Jeffrey H. Kingston
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3616)


This paper presents a tiling algorithm for high school timetabling. The meetings are grouped into small, regular clusters called tiles, each of which is thereafter treated as a unit. Experiments with three actual instances show that tiling, coupled with an alternating path algorithm for assigning resources to meetings after times are fixed, produces good, comprehensible timetables in about ten seconds.


Student Group Double Period Maximum Match Demand Node Timetabling Problem 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Cooper, T.B., Kingston, J.H.: The Solution of Real Instances of the Timetabling Problem. Comput. J. 36, 645–653 (1993)CrossRefGoogle Scholar
  3. 3.
    Cooper, T.B., Kingston, J.H.: The Complexity of Timetable Construction Problems. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 283–295. Springer, Heidelberg (1996)Google Scholar
  4. 4.
    Dyer, J.S., Mulvey, J.M.: Computerized Scheduling and Planning. New Directions Inst. Res. 13, 67–86 (1977)CrossRefGoogle Scholar
  5. 5.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)zbMATHGoogle Scholar
  6. 6.
    de Werra, D.: An Introduction to Timetabling. Eur. J. Oper. Res. 19, 151–162 (1985)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jeffrey H. Kingston
    • 1
  1. 1.School of Information TechnologiesThe University of SydneyAustralia

Personalised recommendations