When is the classroom assignment problem hard?
Operations Research - Supplement
Recent Developments in Practical Course Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Hierarchical timetable construction
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Minimal perturbation problem in course timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A tiling algorithm for high school timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
An application of genetic algorithms to the school timetabling problem
Proceedings of the 2008 annual research conference of the South African Institute of Computer Scientists and Information Technologists on IT research in developing countries: riding the wave of technology
Hierarchical timetable construction
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A study into the use of hyper-heuristics to solve the school timetabling problem
SAICSIT '10 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
Solving effectively the school timetabling problem using particle swarm optimization
Expert Systems with Applications: An International Journal
A hybrid particle swarm optimization based algorithm for high school timetabling problems
Applied Soft Computing
| Hi-index | 0.00 |
KTS is a web-based high school timetabling system, freely accessible on the Internet. This paper is a general survey of KTS, including its data model, user interface, and solver. The solver uses operations research models in a polynomial-time heuristic framework to produce high quality solutions in a few seconds. Results are presented for six instances taken from Australian high schools.