Application of Constraint Hierarchy to Timetabling Problems

Authors:
Tatyana M. Yakhno;Evren Tekin
Affiliations:
-;-
Venue:
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Year:
2002

Citing 4
Cited 0

Constraint hierarchies

Lisp and Symbolic Computation
Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
Integrating Constraints with an Object-Oriented Language

ECOOP '92 Proceedings of the European Conference on Object-Oriented Programming
The Complexity of Timetable Construction Problems

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Timetable scheduling is a well-known instance of scheduling problems. There are many studies done on this subject and it still attracts many researchers since it is one of the most challenging problems in the domain. The present paper considers the application of the hierarchy of constraints which was used for the University timetabling problem. The hierarchy of constraints allows users to specify their preferences according to which the system is looking for solutions that can satisfy most of the users.