The Solution of a Timetabling Problem

Abstract
The problem of producing a teacher-class timetable which minimizes the total time required has been solved Welsh (1971). We solve here the problem of producing such a timetable which also minimizes the space required, when each meeting takes up one room. We consider also the problem in which the pairs meeting are not one from each of two disjoint sets, and in which some of the meetings may have been preassigned to some hour. Finally we state some other practical and theoretical problems to which our results apply.

This publication has 0 references indexed in Scilit: