You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
When Is the Classroom Assignment Problem Hard?
Michael W. Carter and Craig A. Tovey
Vol. 40, Supplement 1: Optimization (Jan. - Feb., 1992), pp. S28-S39
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/3840833
Page Count: 12
Preview not available
The classroom assignment (or hotel room or interval scheduling) problem is to assign classes, which meet at different time intervals, to rooms. Two classes may not meet simultaneously in the same room, nor may a class meet in two different rooms. Thousands of colleges and secondary schools face this problem every semester. There has been some confusion as to how hard this problem is. Many colleges claim that it is easy, while others complain that it is next to impossible. In the literature, some authors claim or conjecture polynomial time algorithms, while others develop heuristic approaches. The goal of this paper is to resolve the confusion by identifying cases where the problem will be easy and others where it will be hard. We focus on the kinds of cases that schedulers are apt to encounter in practice.
Operations Research © 1992 INFORMS