Abstract
Constraint programming is mainly used to solve combinatorial problems such as scheduling and allocation, which are of vital importance to modern business. In this paper, we introduce the course and examination timetabling problems at the German University in Cairo. As manual generation of schedules is time-consuming and inconvenient, we show how these problems can be modeled as constraint satisfaction problems and can be solved using SICStus Prolog with its powerful constraint library.
This is a preview of subscription content, log in via an institution to check access.
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
Abdennadher, S., Frühwirth, T.: Essentials of Constraint Programming. Springer, Heidelberg (2002)
Petrovic, S., Burke, E., Dror, M., Qu, R.: Hybrid graph heuristics within a hyper-heuristic approach to exam timetabling problems. In: The Next Wave in Computing, Optimization, and Decision Technologies (2005)
Eley, M.: Ant Algorithms for the Exam Timetabling Problem. In: Burke, E.K., Rudová, H. (eds.) PATAT 2007. LNCS, vol. 3867. Springer, Heidelberg (2007)
Fernández, A.J., Hill, P.M.: A comparative study of eight constraint programming languages over the boolean and finite domains. Constraints 5(3), 275–301 (2000)
Intelligent Systems Laboratory. SICStus Prolog User’s Manual. Swedish Institute of Computer Science, PO Box 1263, SE-164 29 Kista, Sweden (April 2001)
McCollum, B., Ireland, N.: University timetabling: Bridging the gap between research and practice. In: Burke, E.K., Rudová, H. (eds.) PATAT 2006. LNCS, vol. 3867. Springer, Heidelberg (2007)
Merlot, L.T.G., Boland, N., Hughes, B.D., Stuckey, P.J.: A hybrid algorithm for the examination timetabling problem. In: Burke, E.K., Rudová, H. (eds.) PATAT 2007. LNCS, vol. 3867. Springer, Heidelberg (2007)
Schaerf, A.: A survey of automated timetabling. In: Centrum voor Wiskunde en Informatica (CWI), vol. 115, pp. 30–33 (1995) ISSN 0169-118X
Tsang, E.: Foundation of Constraint Satisfaction. Academic Press, London (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdennadher, S., Aly, M., Edward, M. (2009). Constraint-Based Timetabling System for the German University in Cairo. In: Seipel, D., Hanus, M., Wolf, A. (eds) Applications of Declarative Programming and Knowledge Management. INAP WLP 2007 2007. Lecture Notes in Computer Science(), vol 5437. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00675-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-00675-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00674-6
Online ISBN: 978-3-642-00675-3
eBook Packages: Computer ScienceComputer Science (R0)