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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Azevedo, F., Barahona, P. Timetabling in Constraint Logic Programming. Proceedings of the 2nd World Congress on Expert Systems, 1994.
Baptiste, P., Le Pape, C., Nuijten, W. Incorporating Efficient Operations Research Algorithms in Constraint-Based Scheduling. Proceedings of the First International Joint Workshop on Artificial Intelligence and Operations Research, 1995.
Borning, A., Freeman-Benson, B.,& Wilson, M. Constraint Hierarchies. LISP and Symbolic Computation: An International Journal, 5, 1992, pp. 223–270.
Cooper, T.B.,& Kingston, J.H. The Complexity of Timetable Construction Problems. Proceedings of the First International Conference on the Practice and Theory of Automated Timetabling (ICPTAT’ 95), 1995.
Freeman-Benson, B.N.,& Borning, A. Integrating Constraints with an Object-Oriented Language. Proceedings of the 1992 European Conference on Object-Oriented Programming, pp. 268–286.
Lustig, J.I., Puget, J. Constraint Programming and its Relationship to Mathematical Programming. The Institute for Operations Research and Management Science (INFORMS), Maryland. 2000.
Marriott K., Stuckey P. Programming with Constraints. The MIT Press. UK, 1998.
Russell, S.J., Norvig, P. Artificial Intelligence-A Modern Approach, Prentice Hall, 1995.
Sang, E. Foundations of Constraint Satisfaction. Academic Press, 1993.
Yeung, C., et al. Applying Constraint Satisfaction Technique in University Timetable Scheduling. The Practical Application of Prolog: Proceedings of the 3rd International Conference on the Practical Application of Prolog, UK, 1995, pp. 683–695.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yakhno, T., Tekin, E. (2002). Application of Constraint Hierarchy to Timetabling Problems. In: Shafazand, H., Tjoa, A.M. (eds) EurAsia-ICT 2002: Information and Communication Technology. EurAsia-ICT 2002. Lecture Notes in Computer Science, vol 2510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36087-5_2
Download citation
DOI: https://doi.org/10.1007/3-540-36087-5_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00028-0
Online ISBN: 978-3-540-36087-2
eBook Packages: Springer Book Archive