Name
Abstract | ||
|---|---|---|
This paper describes a computer program for high school timetabling which has completely solved an instance taken without simplification from a large and tightly constrained high school. A timetable specification language allows the program to handle the many idiosyncratic constraints of such instances in a uniform way. New algorithms are introduced which attack the problem more intelligently than traditional search methods. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1093/comjnl/36.7.645 | COMPUTER JOURNAL |
Keywords | Field | DocType |
specification language | Specification language,Computer science,Theoretical computer science,Schedule,Invariant (mathematics),Computer program,Timetabling problem,Search tree | Journal |
Volume | Issue | ISSN |
36 | 7 | 0010-4620 |
Citations | PageRank | References |
19 | 3.58 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tim B. Cooper | 1 | 86 | 8.71 |
| Jeffrey H. Kingston | 2 | 336 | 38.79 |