Modelling timetabling problems with STTL

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

Volumn 2079 LNCS, Issue , 2001, Pages 309-321

  Kingston, Jeffrey H ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

MODELING LANGUAGES; COMPUTATIONAL LINGUISTICS;

HIGH SCHOOL; REAL-WORLD PROBLEM; TIMETABLING; TIMETABLING PROBLEM;

SCHEDULING;

EID: 27144499696     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44629-x_19     Document Type: Conference Paper

References (4)

1. Appleby, J. S., Blake, D. V., Newman, E. A.: Techniques for Producing School Timetables on a Computer and Their Application to Other Scheduling Problems. Comp. J. 3 (1960) 237-245
2. Cooper, T. B., Kingston, J. H.: The Solution of Real Instances of the Timetabling Problem. Comp. J. 36 (1993) 645-653
3. Burke, E. K., Kingston, J. H., Pepper, P. W.: A Standard Data Format for Timetabling Instances. In: Practice and Theory of Automated Timetabling II. Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1997)
4. Kingston, J. H.: The STTL Interpreter, Version 1.0(1999). URL