Local search techniques for large high school timetabling problems

The high school timetabling problem regards the weekly scheduling for all the lectures of a high school. The problem consists in assigning lectures to periods in such a nag that no teacher (or class) is involved in more than one lecture at a time, and other constraints are satisfied. The problem is NP-complete and is usually tackled using heuristic methods. This paper describes a solution algorithm (and its implementation) based on local starch techniques. The algorithm alternates different techniques and different types of mol es and makes use of an adaptive relaxation of the hard constraints. The implementation of the algorithm has been successfully experimented with in some large high schools with various kinds of side constraints.