Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
