Skip to main content
SpringerLink
Log in
Book cover

International Conference on the Practice and Theory of Automated Timetabling

PATAT 2004: Practice and Theory of Automated Timetabling V pp 208–225Cite as

A Tiling Algorithm for High School Timetabling

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3616))

Abstract

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.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Chapter  Google Scholar 

  2. Cooper, T.B., Kingston, J.H.: The Solution of Real Instances of the Timetabling Problem. Comput. J. 36, 645–653 (1993)

    Article  Google Scholar 

  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. Dyer, J.S., Mulvey, J.M.: Computerized Scheduling and Planning. New Directions Inst. Res. 13, 67–86 (1977)

    Article  Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  6. de Werra, D.: An Introduction to Timetabling. Eur. J. Oper. Res. 19, 151–162 (1985)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technologies, The University of Sydney, 2006, Australia

    Jeffrey H. Kingston

Authors
  1. Jeffrey H. Kingston
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Automated Scheduling, Optimisation and Planning Group, School of Computer Science & IT, University of Nottingham, NG8 1BB, Nottingham, UK

    Edmund Burke

  2. Tepper School of Business, Carnegie Mellon University, 15213, Pittsburgh, PA, USA

    Michael Trick

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kingston, J.H. (2005). A Tiling Algorithm for High School Timetabling. In: Burke, E., Trick, M. (eds) Practice and Theory of Automated Timetabling V. PATAT 2004. Lecture Notes in Computer Science, vol 3616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11593577_13

Download citation

  • DOI: https://doi.org/10.1007/11593577_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30705-1

  • Online ISBN: 978-3-540-32421-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation