A hierarchical approach for assigning examinations to thneslots and rooms

A case study

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)69-72
Number of pages4
JournalJournal of Engineering and Applied Sciences
Volume8
Issue number2
DOIs
Publication statusPublished - 2013

Fingerprint

Coloring
Students

Keywords

  • Benchmark
  • Graph colouring
  • Heuristic
  • Malaysia
  • Timetabling

ASJC Scopus subject areas

  • Engineering(all)

Cite this

@article{c55757b7606b4624b654ffb30156c882,
title = "A hierarchical approach for assigning examinations to thneslots and rooms: A case study",
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.",
keywords = "Benchmark, Graph colouring, Heuristic, Malaysia, Timetabling",
author = "Fei, {Yang Xiao} and Masri Ayob and {Ahmad Nazri}, {Mohd Zakree} and Zulkifli Ahmad",
year = "2013",
doi = "10.3923/jeasci.2013.69.72",
language = "English",
volume = "8",
pages = "69--72",
journal = "Journal of Engineering and Applied Sciences",
issn = "1816-949X",
publisher = "Medwell Journals",
number = "2",

}

TY - JOUR

T1 - A hierarchical approach for assigning examinations to thneslots and rooms

T2 - A case study

AU - Fei, Yang Xiao

AU - Ayob, Masri

AU - Ahmad Nazri, Mohd Zakree

AU - Ahmad, Zulkifli

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Benchmark

KW - Graph colouring

KW - Heuristic

KW - Malaysia

KW - Timetabling

UR - http://www.scopus.com/inward/record.url?scp=84884678871&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84884678871&partnerID=8YFLogxK

U2 - 10.3923/jeasci.2013.69.72

DO - 10.3923/jeasci.2013.69.72

M3 - Article

VL - 8

SP - 69

EP - 72

JO - Journal of Engineering and Applied Sciences

JF - Journal of Engineering and Applied Sciences

SN - 1816-949X

IS - 2

ER -