A profiling-based algorithm for exams’ scheduling problem
Abstract
Typically, the problem of scheduling exams for universities aims to determine a schedule that satisfies logistics constraints, including the number of available exam rooms and the exam delivery mode (online or paper-based). The objective of this problem varies according to the university’s requirements. For example, some universities may seek to minimize operational costs, while others may work to minimize the schedule's length. Consequently, the objective imposed by the university affects the complexity of the problem. In this study, we present a grouping-based approach designed to address the problem of scheduling the exam timetable. The approach begins by profiling the courses’ exams based on their requirements, grouping exams with similar requirements to be scheduled at the same time. Then, an insertion strategy is used to obtain the exam schedule while satisfying the imposed constraints of the targeted university. We applied this approach to the problem of exam scheduling at Al-Hussein Bin Talal University in Jordan and achieved a balanced exam schedule that met all the imposed constraints.
Keywords
decision support systems; grouping-based approach; NP-hard problem; scheduling algorithm; timetable;
Full Text:
PDFDOI: http://doi.org/10.11591/ijece.v13i5.pp5483-5490
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
International Journal of Electrical and Computer Engineering (IJECE)
p-ISSN 2088-8708, e-ISSN 2722-2578
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).