A Constraint-Based Approach for Examination Timetabling Using Local Repair Techniques

We present in this paper an algorithm based upon the Constraint Satisfaction Problem model, used at the “ecole des Mines de Nantes” to generate examination timetables. A strong constraint is that the computing time must be less than 1 minute. This led us to develop an incomplete algorithm, using local repair techniques, instead of an exhaustive search method. The program has been validated on fifty “hand-made” problems, and has succesfully solved the thirteen “real” problems.