Solving Kolej Poly-Tech Mara Examination Timetabling Problem

Examination timetabling involves assigning the exams into timeslots and rooms, fitting the student numbers into suitable exam locations, and ensuring adequate rest gaps between exams for all students. In this study, the examination timetabling problem from Kolej Poly-Tech Mara (KPTM) Kuantan, is bei...

Full description

Bibliographic Details
Main Authors: M. N. M., Kahar, Sarina, Abu Bakar, Shing, L. C., Mandal, Ashis Kumar
Format: Article
Language:English
Published: American Scientific Publisher 2018
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/19525/
http://umpir.ump.edu.my/id/eprint/19525/
http://umpir.ump.edu.my/id/eprint/19525/
http://umpir.ump.edu.my/id/eprint/19525/1/Solving%20Kolej%20Poly-Tech%20Mara%20Examination%20Timetabling%20Problem1.pdf
id ump-19525
recordtype eprints
spelling ump-195252018-11-21T05:02:44Z http://umpir.ump.edu.my/id/eprint/19525/ Solving Kolej Poly-Tech Mara Examination Timetabling Problem M. N. M., Kahar Sarina, Abu Bakar Shing, L. C. Mandal, Ashis Kumar QA75 Electronic computers. Computer science Examination timetabling involves assigning the exams into timeslots and rooms, fitting the student numbers into suitable exam locations, and ensuring adequate rest gaps between exams for all students. In this study, the examination timetabling problem from Kolej Poly-Tech Mara (KPTM) Kuantan, is being investigated. The KPTM dataset is a capacitated problem with unique constraints when compared to the benchmark examination datasets from the literature. Currently, KPTM Kuantan uses proprietary software to generate the timetable. However, it requires manual process to determine whether the timetable satisfies the constraints. Furthermore, having no mathematical model makes it difficult to determine the timetable quality. The research aim is to develop a formal mathematical model and test the proposed model by producing an examination timetable. The generated timetable is compared with the KPTM Kuantan proprietary software examination timetable. The experiment shows that our result outperforms the timetable produced by KPTM while adhering to the hard constraints which the proprietary software fails to achieve. American Scientific Publisher 2018 Article PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/19525/1/Solving%20Kolej%20Poly-Tech%20Mara%20Examination%20Timetabling%20Problem1.pdf M. N. M., Kahar and Sarina, Abu Bakar and Shing, L. C. and Mandal, Ashis Kumar (2018) Solving Kolej Poly-Tech Mara Examination Timetabling Problem. Advanced Science Letters, 24 (10). pp. 7577-7581. ISSN 1936-6612 https://doi.org/10.1166/asl.2018.12981 doi: 10.1166/asl.2018.12981
repository_type Digital Repository
institution_category Local University
institution Universiti Malaysia Pahang
building UMP Institutional Repository
collection Online Access
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
M. N. M., Kahar
Sarina, Abu Bakar
Shing, L. C.
Mandal, Ashis Kumar
Solving Kolej Poly-Tech Mara Examination Timetabling Problem
description Examination timetabling involves assigning the exams into timeslots and rooms, fitting the student numbers into suitable exam locations, and ensuring adequate rest gaps between exams for all students. In this study, the examination timetabling problem from Kolej Poly-Tech Mara (KPTM) Kuantan, is being investigated. The KPTM dataset is a capacitated problem with unique constraints when compared to the benchmark examination datasets from the literature. Currently, KPTM Kuantan uses proprietary software to generate the timetable. However, it requires manual process to determine whether the timetable satisfies the constraints. Furthermore, having no mathematical model makes it difficult to determine the timetable quality. The research aim is to develop a formal mathematical model and test the proposed model by producing an examination timetable. The generated timetable is compared with the KPTM Kuantan proprietary software examination timetable. The experiment shows that our result outperforms the timetable produced by KPTM while adhering to the hard constraints which the proprietary software fails to achieve.
format Article
author M. N. M., Kahar
Sarina, Abu Bakar
Shing, L. C.
Mandal, Ashis Kumar
author_facet M. N. M., Kahar
Sarina, Abu Bakar
Shing, L. C.
Mandal, Ashis Kumar
author_sort M. N. M., Kahar
title Solving Kolej Poly-Tech Mara Examination Timetabling Problem
title_short Solving Kolej Poly-Tech Mara Examination Timetabling Problem
title_full Solving Kolej Poly-Tech Mara Examination Timetabling Problem
title_fullStr Solving Kolej Poly-Tech Mara Examination Timetabling Problem
title_full_unstemmed Solving Kolej Poly-Tech Mara Examination Timetabling Problem
title_sort solving kolej poly-tech mara examination timetabling problem
publisher American Scientific Publisher
publishDate 2018
url http://umpir.ump.edu.my/id/eprint/19525/
http://umpir.ump.edu.my/id/eprint/19525/
http://umpir.ump.edu.my/id/eprint/19525/
http://umpir.ump.edu.my/id/eprint/19525/1/Solving%20Kolej%20Poly-Tech%20Mara%20Examination%20Timetabling%20Problem1.pdf
first_indexed 2023-09-18T22:27:54Z
last_indexed 2023-09-18T22:27:54Z
_version_ 1777416089732382720