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.
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
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.
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.
F. Azevedo and P. Barahona. Timetabling in constraint logic programming. In Proc. World Congress on Expert Systems, 1994.
E. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. J. Mathematical and Computer Modelling, 20(12):97–123, 1994.
P. Boizumault, Y. Delon, and L. Peridy. Constraint logic programming for examination timetabling. J. Logic Programming, 26(2):217–233, 1996.
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.
E. Burke, D. Eiiliman, P. Ford, and R. Weare. Examination timetabling in British universities: A survey. In [8], pages 76–90, 1996.
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.
T. B. Cooper and J. H. Kingston. The complexity of timetable construction problems. In [8], pages 183–295, 1996.
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.
T. Frühwirth. Theory and practice of constraint handling rules. J. Logic Programming, 37:95–138, 1998.
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.
C. Guéret, N. Jussien, P. Boizumault, and C. Prins. Building university timetables using constraint logic programming. In [8], pages 130–145, 1996.
P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge (Mass.),London, 1989.
M. Henz and J. Würtz. Using Oz for college timetabling. In [8], pages 162–177, 1996.
M. Kambi and D. Gilbert. Timetabling in constraint logic programming. In Proc. 9th Symp. on Industrial Applications of PROLOG (INAP’96), Tokyo, Japan, 1996.
G. Lajos. Complete university modular timetabling using constraint logic programming. In [8], pages 146–161, 1996.
K. Marriott and P. J. Stucky. Programming with Constraints: An Introduction. The MIT Press, Cambridge (MA),London, 1998.
A. Schaerf. A survey of automated timetabling. Technical Report CS-R9567, Centrum voor Wiskunde en Informatica, 1995.
G.M. White and J. Zhang. Generating complete university timetables by combining tabu search with constraint logic. In [6], pages 187–198, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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