Application of constraint hierarchy to timetabling problems

Yakhno T., Tekin E.

1st EurAsian Conference on Advances in Information and Communication Technology, EurAsia-ICT 2002, Shiraz, Iran, 29 - 31 October 2002, pp.11-18 identifier

  • Publication Type: Conference Paper / Full Text
  • Volume:
  • Doi Number: 10.1007/3-540-36087-5_2
  • City: Shiraz
  • Country: Iran
  • Page Numbers: pp.11-18
  • Dokuz Eylül University Affiliated: Yes

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. © Springer-Verlag Berlin Heidelberg 2002.