Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/133440| Title: | Conflict reduction in examination schedules |
| Authors: | Colijn, Anton W. Layfield, Colin |
| Keywords: | Graph theory GP (Computer program language) Operations research -- Case studies Experiential research |
| Issue Date: | 1995 |
| Citation: | Colijn, A. W., & Layfield, C. (1995). Conflict reduction in examination schedules. 1st International Conference on the Practice and Theory of Automated Timetabling, Edinburgh. 297-307. |
| Abstract: | Several times a year. Universities and Colleges must generate final examination schedules for many of the courses they offer. There are many issues involved in this schedule generation; these include the generation of a conflict-free schedule and the reduction in the number of students writing back-to-back examinations. This paper deals with the issue of the reduction of these so called second order conflicts and extends the concept further in consideration of third and fourth order conflicts by the use of a two-stage process. The application of these two stages process to examination has been used successfully at the University of Calgary, Canada. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/133440 |
| Appears in Collections: | Scholarly Works - FacICTCIS |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Conflict_reduction_in_examination_schedules.pdf Restricted Access | 543.44 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.
