Publication details

Constraint-based Timetabling with Student Schedules



Year of publication 2000
Type Article in Proceedings
Conference PATAT 2000 - Proceedings of the international conference on the Practice And Theory of Automated Timetabling
MU Faculty or unit

Faculty of Informatics

Web PostScript
Field Use of computers, robotics and its application
Keywords constraint satisfaction; scheduling; preferences
Description One of the peculiarities of university timetabling problems lies in their huge complexity and the easy transition between complex constrained system and an over-constrained one. The Faculty of Informatics timetabling problem represents very complex scheduling and resource allocation problem as individual timetable for every student has to be scheduled with respect to heterogeneous choices of the students for their courses. The problem is solved via constraint logic programming approach, with variables' annotations for computing variable ordering and with special objective function aimed to minimize students' conflicts, both helping to solve over-constrained part of the problem as well as to control exploration of the search space.

You are running an old browser version. We recommend updating your browser to its latest version.

More info