Application of constraint hierarchy to timetabling problems

---

Yakhno T., Tekin E.

EURASIA-ICT 2002: INFORMATION AND COMMUNICATION TECHNOLOGY, PROCEEDINGS, cilt.2510, ss.11-18, 2002 (SCI-Expanded)

• Yayın Türü: Makale / Tam Makale
• Cilt numarası: 2510
• Basım Tarihi: 2002
• Dergi Adı: EURASIA-ICT 2002: INFORMATION AND COMMUNICATION TECHNOLOGY, PROCEEDINGS
• Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED)
• Sayfa Sayıları: ss.11-18
• Dokuz Eylül Üniversitesi Adresli: Hayır

Özet

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.