Skip to main content
SpringerLink
Log in

Resource assignment in high school timetabling

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper explores one aspect of the high school timetabling problem, namely the assignment of resources, such as teachers and rooms, to meetings after times are assigned. Several algorithms, with run times of just a few seconds, are presented and tested on real-world data. The best of these is currently in operation within KTS, a free, public web site for high school timetabling created by the author. A large bipartite matching model, called the global tixel matching, is used to preserve optimality of one key measure of quality as resource assignment proceeds.

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

  • Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. New York: Prentice Hall.

    Google Scholar 

  • Burke, E., & Gendreau, M. (Eds.) (2008). In 7th international conference on the practice and theory of automated timetabling, PATAT2008, Montreal, August 2008.

  • Burke, E., & Rudová, H. (Eds.) (2007). Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling VI, 6th international conference, PATAT2004, selected papers, Pittsburgh, August 2004. Berlin: Springer.

    Google Scholar 

  • Burke, E., & Trick, M. (Eds.) (2005). Lecture notes in computer science : Vol. 3616. Practice and theory of automated timetabling V, 5th international conference, PATAT2004, selected papers, Pittsburgh, August 2004. Berlin: Springer.

    Google Scholar 

  • Carter, M. W. (2001). A comprehensive course timetabling and student scheduling system at the University of Waterloo. In Lecture notes in computer science : Vol. 2079. Practice and theory of automated timetabling III, 3rd international conference, PATAT2000, selected papers, Konstanz, Germany, August 2000 (pp. 64–81). Berlin: Springer.

    Chapter  Google Scholar 

  • Carter, M. W., & Laporte, G. (1998). Recent developments in practical course timetabling. In Lecture notes in computer science : Vol. 1408. Practice and theory of automated timetabling II, 2nd international conference, PATAT’97, selected papers, University of Toronto, August 1997 (pp. 3–19). Berlin: Springer.

    Chapter  Google Scholar 

  • Carter, M. W., & Tovey, C. A. (1992). When is the classroom assignment problem hard? Operations Research, 40, S28–S39.

    Article  Google Scholar 

  • Cooper, T. B., & Kingston, J. H. (1995). A program for constructing high school timetables. In Proceedings 1st international conference on the practice and theory of automated timetabling, Edinburgh, UK.

  • de Haan, P., Landman, R., Post, G., & Ruizenaar, H. (2006). A four-phase approach to a timetabling problem in secondary schools. In Proceedings 6th international conference on the practice and theory of automated timetabling, PATAT2006, Brno, Czech Republic (pp. 423–425).

  • Jacobsen, F., Bortfeldt, A., & Gehring, H. (2006). Timetabling at German secondary schools: tabu search versus constraint programming. In Proceedings 6th international conference on the practice and theory of automated timetabling, PATAT2006, Brno, Czech Republic (pp. 439–442).

  • Kingston, J. H. (2005). A tiling algorithm for high school timetabling. In Lecture notes in computer science : Vol. 3616. Practice and theory of automated timetabling V, 5th international conference, PATAT2004, selected papers, Pittsburgh, PA, August 2004 (pp. 208–225). Berlin: Springer.

    Chapter  Google Scholar 

  • Kingston, J. H. (2007a). The KTS high school timetabling web site (Version 1.6). http://www.it.usyd.edu.au/~jeff.

  • Kingston, J. H. (2007b). The KTS high school timetabling system. In Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling VI, 6th international conference, PATAT2006, selected papers, Brno, Czech Republic, August 2006. Berlin: Springer.

    Google Scholar 

  • Kingston, J. H. (2007c). Hierarchical timetable construction. In Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling VI, 6th international conference, PATAT2006, selected papers, Brno, Czech Republic, August 2006. Berlin: Springer.

    Google Scholar 

  • Mulvey, J. M. (1982). A classroom/time assignment model. European Journal of Operational Research, 9, 64–70.

    Article  Google Scholar 

  • Post, G., Ahmadi, S., Daskalaki, S., Kingston, J., Kyngas, J., Kimmo, N., Ranson, D., & Ruizenaar, H. (2008). An XML format for benchmarks in high school timetabling. In 7th international conference on the practice and theory of automated timetabling, PATAT2008, Montreal, August 2008.

  • Wilke, P. (2008). Solving the school time tabling problem using tabu search, simulated annealing, genetic and branch and bound algorithms. In 7th international conference on the practice and theory of automated timetabling, PATAT2008, Montreal, August 2008.

Download references

Author information

Authors and Affiliations

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

    Jeffrey H. Kingston

Authors
  1. Jeffrey H. Kingston
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jeffrey H. Kingston.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kingston, J.H. Resource assignment in high school timetabling. Ann Oper Res 194, 241–254 (2012). https://doi.org/10.1007/s10479-010-0695-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-010-0695-0

Keywords

Search

Navigation