Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The OPL optimization programming language
The OPL optimization programming language
Scheduling Classes on a College Campus
Computational Optimization and Applications
Recent Developments in Practical Course Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Principles of Constraint Programming
Principles of Constraint Programming
The KTS high school timetabling system
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A tiling algorithm for high school timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
The KTS high school timetabling system
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A simulated annealing based approach to the high school timetabling problem
IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning
| Hi-index | 0.00 |
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.