The application of a graph-partitioning algorithm to the scheduling of curriculum requirements

In this paper we consider a problem involving the scheduling of courses to academic terms in order that curriculum requirements be satisfied. The problem is converted to one in which a set of sub-graphs of a complete graph are sought which are of maximal total edge weight. A previously developed algorithm is modified to treat the problem such that a step-by-step procedure is given and demonstrated. Computational experience with the algorithm is discussed.