Abstract
We consider the problem of scheduling a set of classes to classrooms with the objective of minimizing the number of classrooms used. The major constraint that we must obey is that no two classes can be assigned to the same classroom at the same time on the same day of the week. We present an algorithm that produces a nearly optimal schedule for an arbitrary set of classes. The algorithm's first stage produces a packing of classes using a combination of a greedy algorithm and a non-bipartite matching and the second stage consists of a bipartite matching.
First we show that for one variant of the problem our algorithm produces schedules that require a number of classrooms that is always within a small additive constant of optimal. Then we show that for an interesting variant of the problem the same algorithm produces schedules that require a small constant factor more classrooms than optimal. Finally, we report on experimental results of our algorithm using actual data and also show how to create schedules with other desirable characteristics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice Hall, 1993.
M. Carter and C. Tovey, “When is the classroom assignment problem hard?” Operations Research, vol. 40, supp 1, pp. S28–S39, 1992.
X. Deng, H. Liu, J. Long, and B. Xiao, “Competitive analysis of network load balancing,” Journal of Parallel and Distributed Computing, vol. 40, no. 2, pp. 162–172, 1997.
J. Ferland and S. Roy, “Timetabling problem for university as assignment of activities to resources,” Computers and Operations Research, vol. 12, no. 2, pp. 207–218, 1985.
J. Ferland, S. Roy, and T. Loc, “The timetabling problem,” in OR Models on Microcomputers, 1986, pp. 97-103.
P. Fizzano, “Centralized and distributed algorithms for network scheduling,” PhD Thesis, Dartmouth College, 1995.
M.L. Fredman and R.E. Tarjan, “Fibonacci heaps and their uses in improved network optimization algorithms,” Journal of the ACM, vol. 34, pp. 596–615, 1987.
D. Gale and L.S. Shapley, “College admissions and the stability of marraige,” American Mathematical Monthly, vol. 69, pp. 9–14, 1962.
D. Gusfield and R.W. Irving, The Stable Marraige Problem: Structure and Algorithms, MIT Press, 1989.
D. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems, PWS, 1997.
B. Hoppe and E. Tardos, “The quickest transhipment problem,” in Proceedings of the 6th Annual Symposium on Discrete Algorithms, 1995.
Max Planck Institute for Computer Science, “Leda, the library of efficient data structures and algorithms,” v. 3.1, 1995.
S. Micali and V.V. Vazirani, “An \(O(\sqrt {|\,v\,|} \; \cdot |\,E\,|)\) algorithm for finding maximum matching in general graphs,” in 21st Annual Symposium on Foundations of Computer Science, 1980, pp. 17-27.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fizzano, P., Swanson, S. Scheduling Classes on a College Campus. Computational Optimization and Applications 16, 279–294 (2000). https://doi.org/10.1023/A:1008720430012
Issue Date:
DOI: https://doi.org/10.1023/A:1008720430012