Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/11593577_13 | PATAT |
Keywords | Field | DocType |
high school timetabling,path algorithm,tiling algorithm,regular cluster,actual instance,assigning resource,comprehensible timetable | Computer science,Algorithm,Timetabling problem | Conference |
Volume | ISSN | ISBN |
3616 | 0302-9743 | 3-540-30705-2 |
Citations | PageRank | References |
23 | 1.21 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jeffrey H. Kingston | 1 | 336 | 38.79 |