Skip to main content
SpringerLink
Log in

University Timetabling Using Constraint Logic Programming

  • Conference paper
  • First Online:
Practical Aspects of Declarative Languages (PADL 1999)

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

Included in the following conference series:

Abstract

A timetable is a temporal arrangement of a set of meetings such that all given constraints are satisfied. A timetabling problem can be suitably modelled in terms of a set of constraints. We use Constraint Logic Programming and develop methods, techniques and concepts for a combination of interactive and automatic timetabling of university courses and school curricula. An exemplary application of such a timetabling system was developed for the Charité Medical Faculty at the Humboldt University, Berlin. The timetabling system is flexible enough to take into account special user requirements and to allow constraints to be modified easily if no basic conceptual change in the timetabling is necessary. An essential component is an automatic heuristic solution search with an interactive user-intervention facility. The user will, however, only be able to alter a timetable or schedule such that no hard constraints are violated.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abdennadher and M. Marte. University timetabling using constraint handling rules. In O. Ridoux, editor, Proc. JFPLC’98, Journées Francophones de Programmation Logique et Programmation par Constraintes, pages 39–49, Paris, 1998. Hermes.

    Google Scholar 

  2. A. Aggoun and N. Beldiceanu. Extending CHIP in order to solve complex scheduling and placement problems. J. Mathematical and Computer Modelling, 17(7):57–73, 1993.

    Article  Google Scholar 

  3. F. Azevedo and P. Barahona. Timetabling in constraint logic programming. In Proc. World Congress on Expert Systems, 1994.

    Google Scholar 

  4. E. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. J. Mathematical and Computer Modelling, 20(12):97–123, 1994.

    Article  MATH  Google Scholar 

  5. P. Boizumault, Y. Delon, and L. Peridy. Constraint logic programming for examination timetabling. J. Logic Programming, 26(2):217–233, 1996.

    Article  MATH  Google Scholar 

  6. E. Burke and M. Carter, editors. Practice and Theory of Automated Timetabling II, volume 1408 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, 1998.

    Google Scholar 

  7. E. Burke, D. Eiiliman, P. Ford, and R. Weare. Examination timetabling in British universities: A survey. In [8], pages 76–90, 1996.

    Google Scholar 

  8. E. Burke and P. Ross, editors. Practice and Theory of Automated Timetabling, volume 1153 of Lecture Notes in Computer Science. Springer-Verlag, Berlin,Heidelberg, 1996.

    Google Scholar 

  9. T. B. Cooper and J. H. Kingston. The complexity of timetable construction problems. In [8], pages 183–295, 1996.

    Google Scholar 

  10. M. Dincbas, P. van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The constraint logic programming language CHIP. In Int. Conf. Fifth Generation Computer Systems (FGCS∝88), pages 693–702, Tokyo, 1988.

    Google Scholar 

  11. T. Frühwirth. Theory and practice of constraint handling rules. J. Logic Programming, 37:95–138, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  12. H.-J. Goltz. Reducing domains for search in CLP(FD) and its application to jobshop scheduling. In U. Montanari and F. Rossi, editors, Principles and Practice of Constraint Programming-CP’95, volume 976 of Lecture Notes in Computer Science, pages 549–562, Berlin, Heidelberg, 1995. Springer-Verlag.

    Google Scholar 

  13. C. Guéret, N. Jussien, P. Boizumault, and C. Prins. Building university timetables using constraint logic programming. In [8], pages 130–145, 1996.

    Google Scholar 

  14. P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge (Mass.),London, 1989.

    Google Scholar 

  15. M. Henz and J. Würtz. Using Oz for college timetabling. In [8], pages 162–177, 1996.

    Google Scholar 

  16. M. Kambi and D. Gilbert. Timetabling in constraint logic programming. In Proc. 9th Symp. on Industrial Applications of PROLOG (INAP’96), Tokyo, Japan, 1996.

    Google Scholar 

  17. G. Lajos. Complete university modular timetabling using constraint logic programming. In [8], pages 146–161, 1996.

    Google Scholar 

  18. K. Marriott and P. J. Stucky. Programming with Constraints: An Introduction. The MIT Press, Cambridge (MA),London, 1998.

    MATH  Google Scholar 

  19. A. Schaerf. A survey of automated timetabling. Technical Report CS-R9567, Centrum voor Wiskunde en Informatica, 1995.

    Google Scholar 

  20. G.M. White and J. Zhang. Generating complete university timetables by combining tabu search with constraint logic. In [6], pages 187–198, 1998.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GMD — German National Research Center for Information Technology GMD-FIRST, Rudower Chaussee 5, D-12489, Berlin

    Hans-Joachim Goltz & Dirk Matzke

Authors
  1. Hans-Joachim Goltz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dirk Matzke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, New Mexico State University, Box 30001, New Science Hall (MS CS) Stewart Street, Las Cruces, NM, 88003, USA

    Gopal Gupta

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goltz, HJ., Matzke, D. (1998). University Timetabling Using Constraint Logic Programming. In: Gupta, G. (eds) Practical Aspects of Declarative Languages. PADL 1999. Lecture Notes in Computer Science, vol 1551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49201-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-49201-1_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65527-5

  • Online ISBN: 978-3-540-49201-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation