Search strategy for constraint-based class-teacher timetabling

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

Volumn 2740, Issue , 2003, Pages 247-261

  Legierski, Wojciech ^a  

^a SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING; CONSTRAINT THEORY; HIGH LEVEL LANGUAGES; TEACHING;

COMPLEX CONSTRAINTS; CONCURRENT CONSTRAINT; CONSTRAINT PROGRAMMING; DISTRIBUTION STRATEGIES; FEASIBLE SOLUTION; HIGH-LEVEL ABSTRACTION; SCHEDULING PROBLEM; SEARCH STRATEGIES;

SCHEDULING;

EID: 35248816114     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45157-0_16     Document Type: Article

References (17)

1. Boufflet J.P., Negre S.: Three Methods Used to Solve an Examination Timetable Problem. In: Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 327-344
2. Elmohamed S., Coddington P., Fox G.: A Comparison of Annealing Techniques for Academic Course Scheduling. In: Burke, E, Carter, M. (Eds.): Practice and Theory of Automated Timetabling II (PATAT 1997, Toronto, Canada, August, selected papers). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 92-112
3. Guéret C., Jussien N., Boizumault P., Prins C.: Building University Modular Timetabling Using Constraint Logic Programming. In: Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 130-145
4. Henz M., Würtz J.: Using Oz for College Timetabling, In: Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 162-177
5. Jussien N., Lhomme O.: Local Search with Constraint Propagation and Conflict-Based Heuristic, Artif. Intell. 139 (2002) 21-45
6. Kaneko K., Yoshikawa M., Nakakuki Y.: Improving a Heuristic Repair Method for Large-Scale School Timetabling Problems. In: Principles and Practice of Constraint Programming (Proc. CP'99). Springer-Verlag, Berlin Heidelberg New York (2000) 275-288
7. Lajos G.: Complete University Modular Timetabling Using Constraint Logic, Practice and Theory of Automated Timetabling. In: Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 146-161
8. Mozart Consortium. The Mozart Programming System. Documentation and system available at http://www.mozart-oz.org
9. Rich D.C.: A Smart Genetic Algorithm for University Timetabling. In: Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 181-197
10. Régin J.C.: Generalized Arc Consistency for Global Cardinality Constraints. In: Proc. AAAI'96 (Portland, OR) (1996) 209-215
11. Rudová H.: Constraint Satisfaction with Preferences, Ph.D. Thesis, Brno (2001)
12. Schulte C.: Comparing Trailing and Copying for Constraint Programming. In: Proc. 16th Int. Conf. Logic Program. (1999)
13. Schulte C.: Programming Constraint Inference Engines. In: Proc. 3rd Int. Conf. on Principles and Practice of Constraint Programming (Schloss Hagenberg, Linz, Austria). Lecture Notes in Computer Science (1997)
14. Schulte C.: Programming Constraint Services. PhD Thesis, Saarbrócken (2000)
15. White G.M., Zhang J.: Generating Complete University Timetables by Combining Tabu Search and Constraint Logic. In: Burke, E, Carter, M. (Eds.): Practice and Theory of Automated Timetabling II (PATAT 1997, Toronto, Canada, August, selected papers). Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 187-198
16. Würtz J.: Oz Scheduler: A Workbench for Scheduling Problems. In: Proc. 8th Int. Conf. on Tools with Artificial Intelligence (1996) 149-156
17. Zervoudakis K., Stamatopoulos P.: A Generic Object-Oriented Constraint-Based Model for University Course Timetabling. In: Burke, E, Erben W. (Eds.): Practice and Theory of Automated Timetabling III (PATAT 2000, Konstanz, Germany, August, selected papers). Lecture Notes in Computer Science, Vol. 2079. Springer-Verlag, Berlin Heidelberg New York (2001) 28-47