University course timetabling using constraint handling rules

Timetabling the courses offered at the Computer Science Department of the University of Munich requires the processing of hard and soft constraints. Hard constraints are conditions that must be satisfied soft constraints, however, may be violated, but should be satisfied as much as possible. This paper shows how to model the timetabling problem as partial constraint satisfaction problem and gives a concise finite domain solver implemented with constraint handling rules that, by performing soft constraint propagation, allows for making soft constraints an active part of the problem-solving process. Furthermore, efficiency is improved by reusing parts of the timetable of the previous year. This prototype needs only a few minutes to create a timetable while manual timetabling usually takes a few days. This was presented at the Systems'98 Computer Fair in Munich and several universities have inquired about it.

[1]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[2]  Roger Mohr,et al.  Good Old Discrete Relaxation , 1988, ECAI.

[3]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[4]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[5]  Alan Borning,et al.  Constraint hierarchies , 1992 .

[6]  Slim Abdennadher,et al.  Constraint-Programmierung - Grundlagen und Anwendungen , 1997 .

[7]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[8]  Slim Abdennadher,et al.  Operational Semantics and Confluence of Constraint Propagation Rules , 1997, CP.

[9]  Francesca Rossi,et al.  Semiring-based constraint satisfaction and optimization , 1997, JACM.

[10]  Slim Abdennadher,et al.  University timetabling using constraint handling rules , 1998, JFPLC.

[11]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[12]  R. Dechter.  to Constraint Satisfaction , 1991 .

[13]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[14]  Martin Henz,et al.  Using Oz for College Timetabling , 1995, PATAT.

[15]  Eugene C. Freuder,et al.  Understanding and Improving the MAC Algorithm , 1997, CP.

[16]  Peter J. Stuckey,et al.  Programming with Constraints: An Introduction , 1998 .

[17]  Arabellastrasse,et al.  Constraint Handling Rules ? , 1995 .

[18]  Michael Marte,et al.  Constraint-Based Grammar School Timetabling - A Case Study , 1998 .

[19]  M. Kambi,et al.  Timetabling in constraint logic programming , 1996 .