Skip to main content
SpringerLink
Log in
Book cover

Eurasian Conference on Information and Communication Technology

EurAsia-ICT 2002: EurAsia-ICT 2002: Information and Communication Technology pp 11–18Cite as

Application of Constraint Hierarchy to Timetabling Problems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2510))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Azevedo, F., Barahona, P. Timetabling in Constraint Logic Programming. Proceedings of the 2nd World Congress on Expert Systems, 1994.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. Borning, A., Freeman-Benson, B.,& Wilson, M. Constraint Hierarchies. LISP and Symbolic Computation: An International Journal, 5, 1992, pp. 223–270.

    Article  Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. Lustig, J.I., Puget, J. Constraint Programming and its Relationship to Mathematical Programming. The Institute for Operations Research and Management Science (INFORMS), Maryland. 2000.

    Google Scholar 

  7. Marriott K., Stuckey P. Programming with Constraints. The MIT Press. UK, 1998.

    MATH  Google Scholar 

  8. Russell, S.J., Norvig, P. Artificial Intelligence-A Modern Approach, Prentice Hall, 1995.

    Google Scholar 

  9. Sang, E. Foundations of Constraint Satisfaction. Academic Press, 1993.

    Google Scholar 

  10. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Department, Dokuz Eylul University, Izmir, Turkey

    Tatyana Yakhno & Evren Tekin

Authors
  1. Tatyana Yakhno
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Evren Tekin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Mathematics and Computer Science Computer Science Department, Shahid Bahonar University, 22 Bahman Bulvard, Kerman, Iran

    Hassan Shafazand

  2. Fraunhofer IPSI, Dolivostr. 15, 64293, Darmstadt, Germany

    Hassan Shafazand

  3. Institute of Software Technology, Vienna University of Technology, Favoritenstr. 9/188, 1040, Vienna, Austria

    A. Min Tjoa

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation