A Three Phased Approach To Final Exam Scheduling
- 1 March 1989
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 21 (1) , 86-96
- https://doi.org/10.1080/07408178908966211
Abstract
A multi-phase examination scheduling process applicable to large university settings in general and SUNY at Buffalo (SUNYAB) in particular is proposed. Each scheduling phase is considered an integral part of the overall scheduling process and solved independently. Phase one of scheduling process is wth the assignment of examinations to exam blocks (each containing one or more exams). The objective of this phase is to minimize the number of students taking more than one exam in the same exam block. The problem is solved using a variation of the quadratic assignment problem. Phase two of the scheduling process uses the results from phase one as input. The exam blocks are assigned to exam days in such a way that some measure of students' comfort is maintained. Phase two of the scheduling process is formulated as a set covering problem with an extra constraint. Phase three of the scheduling process which is involved wt h the assignment of exam blocks to exam periods in each day and optimal ordering of exam days is solved heuristically using a traveling salesman problem as part of solution procedure. The performance of the algorithms devised for the multi-phase scheduling process are tested both in terms of quality of the solutions obtained and the computer time to generate these solutions.Keywords
This publication has 21 references indexed in Scilit:
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- An Algorithm for Determining the Chromatic Number of a GraphSIAM Journal on Computing, 1973
- Chromatic Scheduling and the Chromatic Number ProblemManagement Science, 1972
- An algorithm for the chromatic number of a graphThe Computer Journal, 1971
- Scheduling to reduce conflict in meetingsCommunications of the ACM, 1970
- Scheduling university course examinations by computerCommunications of the ACM, 1967
- Scheduling to Minimize Interaction CostOperations Research, 1966
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- Final examination schedulingCommunications of the ACM, 1964
- The preparation of examination time-tables using a small-store computerThe Computer Journal, 1964