Solving the viva presentations timetabling problem: A case study at FTSM-UKM

Masri Ayob, Ghaith M. Jaradat, Abdul Razak Hamdan, Hafiz Mohd Sarim, Mohd Zakree Ahmad Nazri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

There is a growing need to automatically timetable viva presentations for postgraduate candidates due to the increasing number of students enrolled each year, and hence, requiring additional personnel effort. The automatic timetabling process involves the assignment of the people involved in the viva timetable into a limited number of timeslots and rooms. In order to produce a feasible timetable, we must satisfy some regulations (hard constraints), while attempting to accommodate as much as possible some preferences (soft constraints). In this work, we tackle the problem of scheduling viva presentations for the Masters degree students at FTSM-UKM as a case study. Each presentation must be attended by a chair of the school (or representative), a chair of the viva presentation, a technical committee member, a student (presenter), an internal examiner and supervisor(s). The presentation must be scheduled into a room and timeslot. In this work, we propose a new objective function to model the problem and to evaluate the quality of the timetable (schedule). We also introduce a greedy constructive heuristic to construct a valid timetable that satisfies all of the hard constraints and tries to satisfy the soft constraints as much as possible. The heuristic will assign the committee and students into an empty timetable based on a pre-ordered list of prioritized elements. These elements are ordered based on the largest enrolment: specifically a technical person who has the largest number of students enrolled under his/her supervision and examination will be ordered first in the list and is first to be assigned into the timetable. Results show that the automated timetabling solver can efficiently produce good quality timetable in reasonable time.

Original languageEnglish
Title of host publicationProceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011
DOIs
Publication statusPublished - 2011
Event2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011 - Bandung
Duration: 17 Jul 201119 Jul 2011

Other

Other2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011
CityBandung
Period17/7/1119/7/11

Fingerprint

Students
Supervisory personnel
Scheduling
Personnel

Keywords

  • greedy constructive heuristic
  • Viva presentation timetabling problem

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Ayob, M., Jaradat, G. M., Hamdan, A. R., Mohd Sarim, H., & Ahmad Nazri, M. Z. (2011). Solving the viva presentations timetabling problem: A case study at FTSM-UKM. In Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011 [6021816] https://doi.org/10.1109/ICEEI.2011.6021816

Solving the viva presentations timetabling problem : A case study at FTSM-UKM. / Ayob, Masri; Jaradat, Ghaith M.; Hamdan, Abdul Razak; Mohd Sarim, Hafiz; Ahmad Nazri, Mohd Zakree.

Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011. 2011. 6021816.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ayob, M, Jaradat, GM, Hamdan, AR, Mohd Sarim, H & Ahmad Nazri, MZ 2011, Solving the viva presentations timetabling problem: A case study at FTSM-UKM. in Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011., 6021816, 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011, Bandung, 17/7/11. https://doi.org/10.1109/ICEEI.2011.6021816
Ayob M, Jaradat GM, Hamdan AR, Mohd Sarim H, Ahmad Nazri MZ. Solving the viva presentations timetabling problem: A case study at FTSM-UKM. In Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011. 2011. 6021816 https://doi.org/10.1109/ICEEI.2011.6021816
Ayob, Masri ; Jaradat, Ghaith M. ; Hamdan, Abdul Razak ; Mohd Sarim, Hafiz ; Ahmad Nazri, Mohd Zakree. / Solving the viva presentations timetabling problem : A case study at FTSM-UKM. Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011. 2011.
@inproceedings{2f3eb349b725466ba893db7d27ef6ede,
title = "Solving the viva presentations timetabling problem: A case study at FTSM-UKM",
abstract = "There is a growing need to automatically timetable viva presentations for postgraduate candidates due to the increasing number of students enrolled each year, and hence, requiring additional personnel effort. The automatic timetabling process involves the assignment of the people involved in the viva timetable into a limited number of timeslots and rooms. In order to produce a feasible timetable, we must satisfy some regulations (hard constraints), while attempting to accommodate as much as possible some preferences (soft constraints). In this work, we tackle the problem of scheduling viva presentations for the Masters degree students at FTSM-UKM as a case study. Each presentation must be attended by a chair of the school (or representative), a chair of the viva presentation, a technical committee member, a student (presenter), an internal examiner and supervisor(s). The presentation must be scheduled into a room and timeslot. In this work, we propose a new objective function to model the problem and to evaluate the quality of the timetable (schedule). We also introduce a greedy constructive heuristic to construct a valid timetable that satisfies all of the hard constraints and tries to satisfy the soft constraints as much as possible. The heuristic will assign the committee and students into an empty timetable based on a pre-ordered list of prioritized elements. These elements are ordered based on the largest enrolment: specifically a technical person who has the largest number of students enrolled under his/her supervision and examination will be ordered first in the list and is first to be assigned into the timetable. Results show that the automated timetabling solver can efficiently produce good quality timetable in reasonable time.",
keywords = "greedy constructive heuristic, Viva presentation timetabling problem",
author = "Masri Ayob and Jaradat, {Ghaith M.} and Hamdan, {Abdul Razak} and {Mohd Sarim}, Hafiz and {Ahmad Nazri}, {Mohd Zakree}",
year = "2011",
doi = "10.1109/ICEEI.2011.6021816",
language = "English",
isbn = "9781457707520",
booktitle = "Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011",

}

TY - GEN

T1 - Solving the viva presentations timetabling problem

T2 - A case study at FTSM-UKM

AU - Ayob, Masri

AU - Jaradat, Ghaith M.

AU - Hamdan, Abdul Razak

AU - Mohd Sarim, Hafiz

AU - Ahmad Nazri, Mohd Zakree

PY - 2011

Y1 - 2011

N2 - There is a growing need to automatically timetable viva presentations for postgraduate candidates due to the increasing number of students enrolled each year, and hence, requiring additional personnel effort. The automatic timetabling process involves the assignment of the people involved in the viva timetable into a limited number of timeslots and rooms. In order to produce a feasible timetable, we must satisfy some regulations (hard constraints), while attempting to accommodate as much as possible some preferences (soft constraints). In this work, we tackle the problem of scheduling viva presentations for the Masters degree students at FTSM-UKM as a case study. Each presentation must be attended by a chair of the school (or representative), a chair of the viva presentation, a technical committee member, a student (presenter), an internal examiner and supervisor(s). The presentation must be scheduled into a room and timeslot. In this work, we propose a new objective function to model the problem and to evaluate the quality of the timetable (schedule). We also introduce a greedy constructive heuristic to construct a valid timetable that satisfies all of the hard constraints and tries to satisfy the soft constraints as much as possible. The heuristic will assign the committee and students into an empty timetable based on a pre-ordered list of prioritized elements. These elements are ordered based on the largest enrolment: specifically a technical person who has the largest number of students enrolled under his/her supervision and examination will be ordered first in the list and is first to be assigned into the timetable. Results show that the automated timetabling solver can efficiently produce good quality timetable in reasonable time.

AB - There is a growing need to automatically timetable viva presentations for postgraduate candidates due to the increasing number of students enrolled each year, and hence, requiring additional personnel effort. The automatic timetabling process involves the assignment of the people involved in the viva timetable into a limited number of timeslots and rooms. In order to produce a feasible timetable, we must satisfy some regulations (hard constraints), while attempting to accommodate as much as possible some preferences (soft constraints). In this work, we tackle the problem of scheduling viva presentations for the Masters degree students at FTSM-UKM as a case study. Each presentation must be attended by a chair of the school (or representative), a chair of the viva presentation, a technical committee member, a student (presenter), an internal examiner and supervisor(s). The presentation must be scheduled into a room and timeslot. In this work, we propose a new objective function to model the problem and to evaluate the quality of the timetable (schedule). We also introduce a greedy constructive heuristic to construct a valid timetable that satisfies all of the hard constraints and tries to satisfy the soft constraints as much as possible. The heuristic will assign the committee and students into an empty timetable based on a pre-ordered list of prioritized elements. These elements are ordered based on the largest enrolment: specifically a technical person who has the largest number of students enrolled under his/her supervision and examination will be ordered first in the list and is first to be assigned into the timetable. Results show that the automated timetabling solver can efficiently produce good quality timetable in reasonable time.

KW - greedy constructive heuristic

KW - Viva presentation timetabling problem

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

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

U2 - 10.1109/ICEEI.2011.6021816

DO - 10.1109/ICEEI.2011.6021816

M3 - Conference contribution

AN - SCOPUS:80054027316

SN - 9781457707520

BT - Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011

ER -