Complete University modular timetabling using constraint logic programming

  • Gyuri Lajos
Resoning About Constrainsts
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1153)


In preparation for the changeover to a new modular degree structure, at the University of Leeds, a new modular timetable for the 1993–94 academic session had to be constructed from scratch. This paper describes our experience in constructing a large scale modular timetable using Constraint Logic Programming techniques.


Constraint Satisfaction Problem Class Variable Graph Colouring Timetabling Problem Labelling Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Syllabus Plus: A Management Aid to efficient Space and Resource Utilisation in Colleges. Scientia Ltd., St. Johns Innovation Centre, Cowley Rd. Cambridge CB4 4WS, Tel 01223 421221, 1993.Google Scholar
  2. 2.
    D. Abramson. Constructing school timetables using simulated annealing: sequential and parallel algorithms. Management Science, 37(1):98–113, Jan. 1991.Google Scholar
  3. 3.
    Eric Atwell and Gyuri Lajos. Knowledge and Constraint Management: Large Scale Applications. In Knowledge at Work in Universities, pages 21–25. Leeds University Press, 1993.Google Scholar
  4. 4.
    F. Azevedo and P. Barahona. Timetabling in constraint logic programming. In Proceedings of World Congress on Expert Systems'94, January 1994.Google Scholar
  5. 5.
    P. Boizumault, C. Gueret, and N. Jussien. Efficient LabeEing and Constraint Relaxation for Solving Time Tabling Problems. In Proceedings of the Workshop on constraint Languages and their use in Problem Modelling, pages 116–130, Ithaca, New York, USA, 1994. International Logic Programming Symposium.Google Scholar
  6. 6.
    E.G. Burke, D.G. Elliman, and R.F. Weare. A Genetic Algorithm for University Timetabling. In Proceedings of the 2nd East-West International Conference on Computer Technologies in Education, pages 35–40, Crimea, Ukraine, September 1994.Google Scholar
  7. 7.
    E.K. Burke, D.G. Elliman, and R. Weare. A university timetabling system based on graph colouring and constraint manipulation. Journal of Research on Computing in Education, 27(1):1–18, 1994.Google Scholar
  8. 8.
    M. Cangalovic and J.A.M. Schreuder. Modelling and solving an acyclic multiperiod timetabling problem. Discrete Applied Mathematics, 35(3):177–95, 6 March 1992.Google Scholar
  9. 9.
    A. Colorni, M. Dorigo, and V. Maniezzo. Genetic algorithms and highly constrained problems: the time-table case. In R. Schwefel, H.-P.; Manner, editor, Parallel Problem Solving from Nature. 1st Workshop, pages 55–9, Dortmund, West Germany, 1991. Springer-Verlag.Google Scholar
  10. 10.
    Dave Corne, Peter Ross, and Hsiao-Lan Fang. Fast Practical Evolutionary Timetabling. In T. Fogarty, editor, Evolutionary Computing: AISB Workshop 1994, Selected Papers, number 865 in Lecture Notes in Computer Science. Springer Verlag, 1994.Google Scholar
  11. 11.
    D. de Werra. An introduction to timetabling. In European Journal of Operational Research [17], pages 151–162.Google Scholar
  12. 12.
    K.A. Dowsland. A timetabling problem in which clashes are inevitable. Journal of the Operational Research Society, 41(10):907–18, Oct. 1990.Google Scholar
  13. 13.
    R. Everetsz, M. Dalgarno, G. Forster, and S. Watt. Syllabus: A Solution to the School Timetabling Problem. In The First European Conference on the Practical Application of Lisp, pages 301–308, 1990.Google Scholar
  14. 14.
    H. Frangouli and V. Harmandas P. Stamatopoulos. UTSE: Construction of Optimum timetables for University Courses — A CLP Based Approach. In The Third International Conference and Exhibition on Practical Applications of Prolog, 1995.Google Scholar
  15. 15.
    Alain Hertz. Finding a feasible course schedule using tabu search. Discrete Applied Mathematics, 35(3):255–70, 6 March 1992.Google Scholar
  16. 16.
    L. Kang, G.H. Von Schoenberg, and G.M. White. Complete university timetabling using logic. Computers & Education, 17(2):145–53, 1991.Google Scholar
  17. 17.
    L. Kang and G.M. White. A logic approach to the resolution of constraints in timetabling. European Journal of Operational Research, 61(3):306–17, 25 Sept. 1992.Google Scholar
  18. 18.
    L. Kiaer and J. Yellen. Weighted graphs and university course timetabling. Computers & Operations Research, 19(1):59–67, Jan. 1992.Google Scholar
  19. 19.
    M. Kovacic. Timetable construction with markovian neural network. European Journal of Operational Research, 69(1):92–6, 27 Aug. 1993.Google Scholar
  20. 20.
    Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, 1994.Google Scholar
  21. 21.
    Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. Logic Programming Series. MIT Press, Cambridge, MA, 1989.Google Scholar
  22. 22.
    Pascal Van Hentenryck. Constraint logic programming. Knowledge Engineering Review, 6(3):151–194, September 1991. (Also available as Brown University Technical Report CS-91-05).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Gyuri Lajos
    • 1
  1. 1.Division of Artificial Intelligence, School of Computer StudiesUniversity of LeedsEngland

Personalised recommendations