Journal of Engineering and Applied Sciences
ISSN: Online 1818-7803ISSN: Print 1816-949x
Abstract
An examination timetabling problem at Universiti Kebangsaan Malaysia is a real world problem with additional constraints such as large-enrollment examinations whose number of students is greater than the size of the largest available room which is not considered in the benchmark datasets (e.g., the ITC 2007 datasets). In this research, researchers propose a hierarchical graph colouring heuristic to construct a feasible examination timetable for this practical problem. The heuristic will first schedule the examinations with more constraints such as large enrollment, specific timeslot or rooms. Followed by the examinations with less constraints that will be scheduled into timeslots and rooms by implementing a basic largest degree with large enrollment heuristic and a two-step backtracking procedure. The examinations are assigned to rooms based on room priority. This heuristic will also be tested on benchmark datasets (e.g., the ITC 2007 datasets) to evaluate its effectiveness. Computational results shows that the proposed heuristic is efficient to generate a feasible solution for this practical problem and the benchmark problem.
How to cite this article:
Yang Xiao Fei, Masri Ayob, Mohd Zakree Ahmad Nazri and Zulkifli Ahmad. A Hierarchical Approach for Assigning Examinations to Timeslots and Rooms: A Case Study.
DOI: https://doi.org/10.36478/jeasci.2013.69.72
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2013.69.72