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

  • Authors:
  • Kyriakos Zervoudakis;Panagiotis Stamatopoulos

  • Affiliations:
  • -;-

  • Venue:
  • PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

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.