In many educational institutions the preparation of a low-conflict-small-duration timetable for conducting the term-end examinations could be a very tedious exercise. This paper outlines a computer-based system for the design of a useful examination schedule. The system employs a computer and an administrator at various stages of design for the processes for which they are best suited to improve the applicability and efficiency of the exercise.
Get full access to this article
View all access options for this article.
References
1.
BroderS., Final Examination Scheduling, Communications of the ACM, 7: 8, pp. 494–498, 1964.
2.
ColeA. J., The Preparation of Examination Time Tables Using a Small Store Computer, The Computer Journal, 7: 2, pp. 117–121, 1964.
3.
HallA. D. and ActionF. S., Scheduling University Course Examinations by Computer, Communications of the ACM, 10: 4, pp. 235–238, 1967.
4.
MehtaN. K., The Application of a Graph Coloring Method to an Examination Scheduling Problem, Interfaces, 11: 5, pp. 57–65, 1981.
5.
WoodD. C., A System for Computing University Examination Timetables, The Computer Journal, 11: 1, pp. 41–47, 1968.
6.
ChristofidesN., Graph Theory—An Algorithmic Approach, Academic Press, New York, 1975.
7.
PunterA., School Timetabling by Computer I—A Graph Colouring Formulation, Computer Education, 27, pp. 23–25, 1977.
8.
BrelazD., New Methods to Color the Vertices of a Graph, Communications of the ACM, 22: 4, pp. 251–256, 1979.
9.
BergeC., The Theory of Graphs and Its Application, John Wiley and Sons, New York, 1962.
10.
MehtaN. K., Accessories for Use with Vertex Coloring Methods for Examination Scheduling, Proceedings of the Midwest AIDS Annual Meeting, Detroit, Michigan, pp. 252–254, April 1981.
