DYNAMIC COURSE SCHEDULING FOR COLLEGE FACULTY VIA ZERO‐ONE PROGRAMMING*

Abstract

ABSTRACT This paper formulates a multi‐period course scheduling problem as a zero‐one programming model. Under various constraints, and for a planning horizon of several terms, the model seeks to maximize: (1) the faculty course preferences in assigning faculty members to courses, and (2) the faculty time preferences in allocating courses to time blocks, via a two‐stage optimization procedure. The multi‐period structure of the model, strengthened by the explicit inclusion of a wide‐range of constraints designed to represent various special requirements has enabled the model to capture the many dynamic features of the course scheduling problem at the college level. As such, it can be used not only for long‐range or short‐range departmental planning, but also as a suitable framework toward the development of a larger, and all‐inclusive course scheduling decision system. The paper begins with a brief review of several related studies and then presents a multi‐period scheduling model and its extensions. Some numerical examples are used to test the model, and the authors' experience, resulting from such tests with several computer codes, is reported. The possible directions for future research are also suggested.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 40 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.