Advertisement

Annals of Operations Research

, Volume 194, Issue 1, pp 241–254 | Cite as

Resource assignment in high school timetabling

  • Jeffrey H. Kingston
Article

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.

Keywords

Time Assignment Demand Node Resource Assignment Supply Node Automate Timetabling 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. New York: Prentice Hall. Google Scholar
  2. Burke, E., & Gendreau, M. (Eds.) (2008). In 7th international conference on the practice and theory of automated timetabling, PATAT2008, Montreal, August 2008. Google Scholar
  3. 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
  4. 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
  5. 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. CrossRefGoogle Scholar
  6. 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. CrossRefGoogle Scholar
  7. Carter, M. W., & Tovey, C. A. (1992). When is the classroom assignment problem hard? Operations Research, 40, S28–S39. CrossRefGoogle Scholar
  8. 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. Google Scholar
  9. 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). Google Scholar
  10. 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). Google Scholar
  11. 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. CrossRefGoogle Scholar
  12. Kingston, J. H. (2007a). The KTS high school timetabling web site (Version 1.6). http://www.it.usyd.edu.au/~jeff.
  13. 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
  14. 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
  15. Mulvey, J. M. (1982). A classroom/time assignment model. European Journal of Operational Research, 9, 64–70. CrossRefGoogle Scholar
  16. 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. Google Scholar
  17. 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. Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.School of Information TechnologiesThe University of SydneySydneyAustralia

Personalised recommendations