Abstract | ||
---|---|---|
A hierarchical timetable is one made by recursively joining smaller timetables together into larger ones. Hierarchical timetables ex- hibit 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 ecient 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. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1007/978-3-540-77345-0_19 | Practice and Theory of Automated Timetabling |
Keywords | Field | DocType |
hierarchical timetable construction,flexible construction,web-based high school,hierarchical timetable,mathematical operator,desirable regularity,smaller timetable,data structure | Data structure,Industrial engineering,Mathematical Operators,Transport engineering,Some limitation,Schedule,Engineering,Timetabling problem,Recursion | Conference |
Volume | ISSN | ISBN |
3867 | 0302-9743 | 3-540-77344-4 |
Citations | PageRank | References |
6 | 0.61 | 8 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jeffrey H. Kingston | 1 | 336 | 38.79 |