A tiling algorithm for high school timetabling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3616 LNCS, Issue , 2005, Pages 208-225

  Kingston, Jeffrey H ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; PROBLEM SOLVING;

CLUSTERS; TILING ALGORITHM;

ALGORITHMS;

EID: 33646006356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593577_13     Document Type: Conference Paper

References (6)

1. Carter, M. W., Laporte, G.: Recent Developments in Practical Course Timetabling. In: Burke, E., Carter, M. (eds.): The Practice and Theory of Automated Timetabling II (PATAT'97, Selected Papers). Lecture Notes in Computer Science, Vol. 1408. Springer, Berlin (1998) 3-19
2. Cooper, T. B., Kingston, J. H.: The Solution of Real Instances of the Timetabling Problem. Comput. J. 36 (1993) 645-653
3. Cooper, T. B., Kingston, J. H.: The Complexity of Timetable Construction Problems. In: Burke, E., Ross, P. (eds.): The Practice and Theory of Automated Timetabling I (PATAT'95, Selected Papers). Lecture Notes in Computer Science, Vol. 1153, Springer, Berlin (1996) 283-295
4. Dyer, J. S., Mulvey, J. M.: Computerized Scheduling and Planning. New Directions Inst. Res. 13 (1977) 67-86
5. Garey, M. R., Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)
6. de Werra, D.: An Introduction to Timetabling. Eur. J. Oper. Res. 19 (1985) 151-162