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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Kingston, F. H. (2006). Hierarchical timetable construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3867 LNCS, pp. 294–307). Springer Verlag. https://doi.org/10.1007/978-3-540-77345-0_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
