In this paper, a heuristic algorithm for constructing school timetables is described. The algorithm is based on an exact method that applies to a family of particular timetable problems. The procedure has been used to construct timetables for Swiss schools having about 50 classes, 80 teachers, and 35 weekly periods. Less than five percent of class/teacher meetings could not be scheduled at some period in the week. (Author)