An improvement algorithm for school timetabling

Open Access
Publisher Website
Google Scholar
Abstract
This paper describes an algorithm for improving infeasible timetables. It reduces the teaching resource, break and spread infeasibilities in three stages. The first of these involves the solution of a series of capacitated transportation problems and is used when an initial timetable is not given. Under the limitations imposed by actual timetables this stage may be simplified. The other two stages each involve solving a series of small integer programming problems which will be called interchange problems, and they determine the movement of entries within the timetable. Such an algorithm can handle fixed and block meetings, sets, allocation of special rooms and variable teacher availability while producing an acceptable spread of repeated meetings.

This publication has 0 references indexed in Scilit: