Abstract
This paper presents a tiling algorithm for high school time-tabling. 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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Kingston, J. H. (2005). A tiling algorithm for high school timetabling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3616 LNCS, pp. 208–225). https://doi.org/10.1007/11593577_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
