Skip to main content

A Generic Object-Oriented Constraint-Based Model for University Course Timetabling

  • Conference paper
  • First Online:

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

Abstract

The construction of course timetables for academic institutions is a very difficult problem with a lot of constraints that have to be respected and a huge search space to be explored, even if the size of the problem input is not significantly large, due to the exponential number of the possible feasible timetables. On the other hand, the problem itself does not have a widely approved definition, since different variations of it are faced by different departments. However, there exists a set of entities and constraints among them which are common to every possible instantiation of the timetabling problem. In this paper, we present a model of this common core in terms of Ilog Solver, a constraint programming object-oriented C++ library, and we show the way this model may be extended to cover the needs of a specific academic unit.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Badri, M.: A Two-Stage Multiobjective Scheduling Model for [Faculty-Course-Time] Assignments. Eur. J. Oper. Res. 94 (1996) 16–28

    Article  MATH  Google Scholar 

  2. Barbadym, V.A.: Computer-Aided School and University Timetabling: The New Wave. In: Burke, E., Ross, P. (eds.): Proc. 1st Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1995) 22–45

    Google Scholar 

  3. Boufflet, J.P., Negre, S.: Three Methods Used to Solve an Examination Timetable Problem. In: Burke, E., Ross, P. (eds.): Proc. 1st Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1995) 327–344

    Google Scholar 

  4. Brelaz, D.: New Methods to Color the Vertices of a Graph. JACM 22 (1979) 251–256

    MATH  MathSciNet  Google Scholar 

  5. Burke, E., Jackson, K., Kingston, J., Weare, R.: Automated University Timetabling: The State of the Art. Comput. J. 40 (1997) 565–571

    Google Scholar 

  6. Chahal, N., de Werra, D.: An Interactive System for Constructing Timetables on a PC. Eur. J. Oper. Res. 40 (1989) 32–37

    Article  MATH  Google Scholar 

  7. de Werra, D.: An Introduction to Timetabling. Eur. J. Oper. Res. 19 (1985) 151–162

    Article  MATH  Google Scholar 

  8. de Werra, D.: The Combinatorics of Timetabling. Eur. J. Oper. Res. 96 (1997) 504–513

    Article  MATH  Google Scholar 

  9. Elmohamed, S., Coddington, P., Fox, G.: A Comparison of Annealing Techniques for Academic Course Scheduling. In: Burke, E., Ross, P. (eds.): Proc. 2nd Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1997) 92–112

    Chapter  Google Scholar 

  10. Erben, W., Keppler, J.: A Genetic Algorithm Solving aWeekly Course-Timetabling Problem. In: Burke, E., Ross, P. (eds.): Proc. 1st Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1995) 198–211

    Google Scholar 

  11. Frangouli, H., Harmandas, V., Stamatopoulos, P.: UTSE: Construction of Optimum Timetables for University Courses-A CLP Based Approach. In: Proc. 3rd Int. Conf. on the Practical Applications of Prolog (1995) 225–243

    Google Scholar 

  12. Geelen, P. A.: Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems. In: Proc. 10th Eur. Conf. on Artificial Intelligence (1992) 31–35

    Google Scholar 

  13. Gent, I.P., MacIntyre, E., Prosser, P., Smith, B.M., Walsh, T.: An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem. In: Proc. 2nd Int. Conf. on the Principles and Practice of Constraint Programming (1996) 179–193

    Google Scholar 

  14. Ginsberg, M.L., Harvey, W.D.: Iterative Broadening. Artif. Intell. 55 (1992) 367–383

    Article  MathSciNet  Google Scholar 

  15. Gotlieb, C.: The Construction of Class-Teacher Timetables. In: Proc. IFIP Congress (1962) 73–77

    Google Scholar 

  16. Gueret, C., Jussien, N., Boizumault, P., Prins, C.: Building University Timetables Using Constraint Logic Programming. In: Burke, E., Ross, P. (eds.): Proc. 1st Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1995) 130–145

    Google Scholar 

  17. Haralick, R.M., Elliott, G.L.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artif. Intell. 14 (1980) 263–313

    Article  Google Scholar 

  18. Harvey, W.D., Ginsberg, M.L.: Limited Discrepancy Search. In: Proc. 14th Int. Joint Conf. on Artificial Intelligence (1995) 607–613

    Google Scholar 

  19. Henz, M., Wurtz, J.: Using Oz for College Timetabling. In: Burke, E., Ross, P. (eds.): Proc. 1st Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1995) 162–177

    Google Scholar 

  20. ILOG S.A.: ILOG Solver 4.4: Reference Manual (1999)

    Google Scholar 

  21. ILOG S.A.: ILOG Solver 4.4: User’s Manual (1999)

    Google Scholar 

  22. Lajos, G.: Complete University Modular Timetabling Using Constraint Logic Programming. In: Burke, E., Ross, P. (eds.): Proc. 1st Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1995) 146–161

    Google Scholar 

  23. Mehta, N.: The Application of a Graph Coloring Method to an Examination Scheduling Problem. Interfaces 11 (1981) 57–64

    Article  Google Scholar 

  24. Rich, D.: A Smart Genetic Algorithm for University Timetabling. In: Burke, E., Ross, P. (eds.): Proc. 1st Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1995) 181–197

    Google Scholar 

  25. P. Shaw. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Proc. 4th Int. Conf. on the Principles and Practice of Constraint Programming (1998) 417–431

    Google Scholar 

  26. Stamatopoulos, P., Viglas, E., Karaboyas, S.: Nearly Optimum Timetable Construction Through CLP and Intelligent Search. Int. J. Artif. Intell. Tools 7 (1998) 415–442

    Article  Google Scholar 

  27. Thompson, J., Dowsland, K.: General Cooling Schedules for a Simulated Annealing Based Timetabling System. In: Burke, E., Ross, P. (eds.): Proc. 1st Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1995) 345–363

    Google Scholar 

  28. van Hentenryck, P., Deville, Y., Teng, C.M.: A Generic Arc-Consistency Algorithm and its Specializations. Artif. Intell. 57 (1992) 291–321

    Article  MATH  Google Scholar 

  29. Walsh, T.: Depth-Bounded Discrepancy Search. In: Proc. 15th Int. Joint Conf. on Artificial Intelligence (1997) 1388–1393

    Google Scholar 

  30. White, G., Zhang, J.: Generating Complete University Timetables by Combining Tabu Search with Constraint Logic. In: Burke, E., Ross, P. (eds.): Proc. 2nd Int. Conf. on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1997) 187–198

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zervoudakis, K., Stamatopoulos, P. (2001). A Generic Object-Oriented Constraint-Based Model for University Course Timetabling. In: Burke, E., Erben, W. (eds) Practice and Theory of Automated Timetabling III. PATAT 2000. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44629-X_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-44629-X_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44629-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics