Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Complexity of Timetable Construction Problems
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Recent Developments in Practical Course Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Applying evolutionary computation to the school timetabling problem: The Greek case
Computers and Operations Research
School timetabling for quality student and teacher schedules
Journal of Scheduling
A case study for timetabling in a dutch secondary school
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Hierarchical timetable construction
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
The KTS high school timetabling system
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
An informed genetic algorithm for the high 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
Cyclic transfers in school timetabling
OR Spectrum
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 |
This paper presents a tiling algorithm for high school timetabling. The meetings are grouped into small, regular clusters called tiles, each of which is thereafter treated as a unit. Experiments with three actual instances show that tiling, coupled with an alternating path algorithm for assigning resources to meetings after times are fixed, produces good, comprehensible timetables in about ten seconds.