Abstract
A hierarchical timetable is one made by recursively joining smaller timetables together into larger ones. Hierarchical timetables exhibit a desirable regularity of structure, at the cost of some limitation of choice in construction. This paper describes a method of specifying hierarchical timetables using mathematical operators, and introduces a data structure which supports the efficient and flexible construction of timetables specified in this way. The approach has been implemented in KTS, a web-based high school timetabling system created by the author.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adriaen, M., De Causmaecker, P., Demeester, P., Vanden Berghe, G.: Tackling the university course timetabling problem with an aggregation approach. In: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Brno, pp. 330–335 (August 2006)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ (1993)
Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)
Burke, E.K., Carter, M. (eds.): PATAT 1997. LNCS, vol. 1408. Springer, Heidelberg (1998)
Burke, E.K., De Causmaecker, P. (eds.): PATAT 2002. LNCS, vol. 2740. Springer, Heidelberg (2003)
Burke, E., Erben, W. (eds.): PATAT 2000. LNCS, vol. 2079. Springer, Heidelberg (2001)
Burke, E.K., Ross, P. (eds.): Practice and Theory of Automated Timetabling. LNCS, vol. 1153. Springer, Heidelberg (1996)
Burke, E.K., Trick, M.A. (eds.): PATAT 2004. LNCS, vol. 3616. Springer, Heidelberg (2005)
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)
Cooper, T.B., Kingston, J.H.: The solution of real instances of the timetabling problem. The Computer Journal 36, 645–653 (1993)
Fizzano, P., Swanson, S.: Scheduling classes on a college campus. Computational Optimization and Applications 16, 279–294 (2000)
van Hoeve, W.J.: A hyper-arc consistency algorithm for the soft alldifferent constraint. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 679–689. Springer, Heidelberg (2004)
Kingston, J.H.: A tiling algorithm for high school timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 233–249. Springer, Heidelberg (2005)
Kingston, J.H.: The KTS high school timetabling web site (Version 1.3) (October 2005), http://www.it.usyd.edu.au/~jeff
Kingston, J.H.: The KTS high school timetabling system. In: Burke, E.K., Rudová, H. (eds.) PATAT 2006. LNCS, vol. 3867, pp. 308–323. Springer, Heidelberg (2007)
Marte, M.: Towards constraint-based school timetabling. In: Proceedings of the Workshop on Modelling and Solving Problems with Constraints (at ICAI 2004), pp. 140–154 (2004)
Van Hentenryck, P.: The OPL Optimization Programming Language. MIT Press, Cambridge, MA (1999)
de Werra, D.: An introduction to timetabling. European Journal of Operational Research 19, 151–162 (1985)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kingston, J.H. (2007). Hierarchical Timetable Construction. In: Burke, E.K., Rudová, H. (eds) Practice and Theory of Automated Timetabling VI. PATAT 2006. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77345-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-77345-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77344-3
Online ISBN: 978-3-540-77345-0
eBook Packages: Computer ScienceComputer Science (R0)