RUDOVÁ, Hana a 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). s. 109-123. ISBN 3-00-003866-3. 2000.
Další formáty:   BibTeX LaTeX RIS
Základní údaje
Originální název Constraint-based Timetabling with Student Schedules
Autoři RUDOVÁ, Hana a Luděk MATYSKA.
Vydání Constance (Germany), PATAT 2000 - Proceedings of the international conference on the Practice And Theory of Automated Timetabling, s. 109-123, 2000.
Další údaje
Originální jazyk angličtina
Typ výsledku Stať ve sborníku
Obor 20200 2.2 Electrical engineering, Electronic engineering, Information engineering
Stát vydavatele Německo
Utajení není předmětem státního či obchodního tajemství
WWW PostScript
Organizační jednotka Fakulta informatiky
ISBN 3-00-003866-3
Klíčová slova anglicky constraint satisfaction; scheduling; preferences
Štítky constraint satisfaction, preferences, scheduling
Změnil Změnila: doc. Mgr. Hana Rudová, Ph.D., učo 3840. Změněno: 21. 5. 2003 21:13.
Anotace
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.
VytisknoutZobrazeno: 29. 3. 2024 09:19