This article describes a decision support system (DSS) for planning course offerings in an academic department. The system involves selection of courses, assignment of instructors to courses, and scheduling of courses. The DSS has been implemented and is currently in use.
Get full access to this article
View all access options for this article.
References
1.
AndrewG. and CollinsR., Matching Faculty to Courses, College and University, 46, pp. 83–89, 1971.
2.
TillettP., An Operations Research Approach to the Assignment of Teachers to Courses, Socio-Economic Planning Sciences, 9, pp. 101–104, 1975.
3.
BreslawJ., A Linear Programming Solution to the Faculty Assignment Problem, Socio-Economic Planning Sciences, 10, pp. 227–230, 1976.
4.
McClureR. and WellsC., A Mathematical Programming Model for Faculty Course Assignments, Decision Sciences, 15, pp. 408–420, 1984.
5.
McClureR. and WellsC., Departmental Planning in Academia by Decision Support, College and University, 61: 2, pp. 81–89, 1986.
6.
BroderS., Final Examination Scheduling, Communications of the ACM, 7: 8, pp. 494–498, May 1964.
7.
WoodD., A System for Computing University Examination Timetables, The Computer Journal, 11: 1, p. 41, May 1968.
8.
GrimesJ., Scheduling to Reduce Conflict in Meetings, Communications of the ACM, June 1970.
9.
LeightonF., A Graph Coloring Algorithm for Large Scheduling Problems, Journal of Research of the National Bureau of Standards, 84: 6, pp. 489–506, November-December 1979.
10.
CarterM. W., A Decomposition Algorithm for Large Scale Timetabling Problems, presented at the Joint TIMS/ORSA, Chicago, April 1983.
11.
LotfiV. I. and SarinS., Graph Coloring Algorithm for Large Scheduling Problems, presented at the Joint TIMS/ORSA Conference, Chicago, April 1983.
12.
dbase III Version 1.1, User Manual, Ashton-Tate, Culver City, California, 1984.
