Constraint-based Timetabling with Student Schedules

RUDOVÁ, Hana and Luděk MATYSKA. Constraint-based Timetabling with Student Schedules. In PATAT 2000 - Proceedings of the international conference on the Practice And Theory of Automated Timetabling. Constance (Germany), 2000, p. 109-123. ISBN 3-00-003866-3.

Basic information

Original name

Constraint-based Timetabling with Student Schedules

Authors

RUDOVÁ, Hana and Luděk MATYSKA

Edition

Constance (Germany), PATAT 2000 - Proceedings of the international conference on the Practice And Theory of Automated Timetabling, p. 109-123, 2000

---

Other information

Language

English

Type of outcome

Proceedings paper

Field of Study

20200 2.2 Electrical engineering, Electronic engineering, Information engineering

Country of publisher

Germany

Confidentiality degree

is not subject to a state or trade secret

References:

PostScript

Organization unit

Faculty of Informatics

ISBN

3-00-003866-3

Keywords in English

constraint satisfaction; scheduling; preferences

Tags

constraint satisfaction, preferences, scheduling

---

Abstract

In the original language

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.