next up previous
Next: Hard Constraints Up: The Timetabling Problem Previous: The Timetabling Problem

Constraints of the Timetabling Problem

Timetabling is the assignment of time slots to a set of events, subject to constraints on these assignments. Generally, a constraint places a restriction on when and where classes may be scheduled. The constraints for this problem can be hard, medium or soft. The medium and soft constraints have an associated cost (or penalty), and if they are not satisfied, the goal is to minimize this cost. The hard constraints must be satisfied, so their associated cost must be reduced to zero. A feasible schedule is one that satisfies all the hard constraints.

In short, the three types of constraints used are:

  1. Hard - These are constraints that must be satisfied.
  2. Medium - These are constraints that should be satisfied, if possible, but are not required for a valid solution or a legal schedule.
  3. Soft - These constraints have a lower priority (and thus lower cost) but it is preferable to minimize this cost.




Saleh Elmohamed
Thu Sep 4 11:43:55 EDT 1997