Case Study: University Lecture Timetabling Without Pre-registration Data

This paper focuses on university lecture timetabling at Faculty of Computer Science and Information Technology (FCSIT), Universiti Malaysia Sarawak (UNIMAS). In this case study, course pre-registration is not a practice. Therefore, there is no precise estimation on course registration and causes...

Full description

Bibliographic Details
Main Authors: Sze, San Nah, Bong, Chia Lih, Chiew, Kangleng, Tiong, Wei King, Noor Alamshah, Bolhassan
Format: Article
Language:English
Published: IEEE 2017
Subjects:
Online Access:http://ir.unimas.my/id/eprint/17119/
http://ir.unimas.my/id/eprint/17119/1/Case%20Study%20University%20Lecture%20Timetabling%20Without%20Pre-registration%20Data%20%28abstract%29.pdf
_version_ 1848838213026709504
author Sze, San Nah
Bong, Chia Lih
Chiew, Kangleng
Tiong, Wei King
Noor Alamshah, Bolhassan
author_facet Sze, San Nah
Bong, Chia Lih
Chiew, Kangleng
Tiong, Wei King
Noor Alamshah, Bolhassan
author_sort Sze, San Nah
building UNIMAS Institutional Repository
collection Online Access
description This paper focuses on university lecture timetabling at Faculty of Computer Science and Information Technology (FCSIT), Universiti Malaysia Sarawak (UNIMAS). In this case study, course pre-registration is not a practice. Therefore, there is no precise estimation on course registration and causes faculty’s experienced planner to arrange the timetable by curriculum-based. However, curriculum-based timetable will create a lot of changes after the semester has started. Besides, students are increasing consistently from semester to semester although the number of venue resources remains the same. Due to all these issues, the objective of this study is to develop a computerised algorithm to minimise the clashes issue and increase venue utilisation. Data pre-processing algorithm was carried out to predict course registration. Then, a two-stage heuristic method is proposed to solve the faculty course timetabling problem by student-based. The simulator was tested with three real semesters’ data from FCSIT. All the timetable solutions generated by the simulator are no-clash solution with minimum unallocated courses. In term of venue utilisation, two-stage heuristic solution manages to allocate exactly with the demand up to 98% but real solution can perform best at only 75%.
first_indexed 2025-11-15T06:51:58Z
format Article
id unimas-17119
institution Universiti Malaysia Sarawak
institution_category Local University
language English
last_indexed 2025-11-15T06:51:58Z
publishDate 2017
publisher IEEE
recordtype eprints
repository_type Digital Repository
spelling unimas-171192017-08-09T01:31:59Z http://ir.unimas.my/id/eprint/17119/ Case Study: University Lecture Timetabling Without Pre-registration Data Sze, San Nah Bong, Chia Lih Chiew, Kangleng Tiong, Wei King Noor Alamshah, Bolhassan LB Theory and practice of education This paper focuses on university lecture timetabling at Faculty of Computer Science and Information Technology (FCSIT), Universiti Malaysia Sarawak (UNIMAS). In this case study, course pre-registration is not a practice. Therefore, there is no precise estimation on course registration and causes faculty’s experienced planner to arrange the timetable by curriculum-based. However, curriculum-based timetable will create a lot of changes after the semester has started. Besides, students are increasing consistently from semester to semester although the number of venue resources remains the same. Due to all these issues, the objective of this study is to develop a computerised algorithm to minimise the clashes issue and increase venue utilisation. Data pre-processing algorithm was carried out to predict course registration. Then, a two-stage heuristic method is proposed to solve the faculty course timetabling problem by student-based. The simulator was tested with three real semesters’ data from FCSIT. All the timetable solutions generated by the simulator are no-clash solution with minimum unallocated courses. In term of venue utilisation, two-stage heuristic solution manages to allocate exactly with the demand up to 98% but real solution can perform best at only 75%. IEEE 2017 Article PeerReviewed text en http://ir.unimas.my/id/eprint/17119/1/Case%20Study%20University%20Lecture%20Timetabling%20Without%20Pre-registration%20Data%20%28abstract%29.pdf Sze, San Nah and Bong, Chia Lih and Chiew, Kangleng and Tiong, Wei King and Noor Alamshah, Bolhassan (2017) Case Study: University Lecture Timetabling Without Pre-registration Data. International Conference on Applied System Innovation (ICASI), 2017. ISSN ISBN: 978-1-5090-4897-7 http://ieeexplore.ieee.org/abstract/document/7988533/ DOI: 10.1109/ICASI.2017.7988533
spellingShingle LB Theory and practice of education
Sze, San Nah
Bong, Chia Lih
Chiew, Kangleng
Tiong, Wei King
Noor Alamshah, Bolhassan
Case Study: University Lecture Timetabling Without Pre-registration Data
title Case Study: University Lecture Timetabling Without Pre-registration Data
title_full Case Study: University Lecture Timetabling Without Pre-registration Data
title_fullStr Case Study: University Lecture Timetabling Without Pre-registration Data
title_full_unstemmed Case Study: University Lecture Timetabling Without Pre-registration Data
title_short Case Study: University Lecture Timetabling Without Pre-registration Data
title_sort case study: university lecture timetabling without pre-registration data
topic LB Theory and practice of education
url http://ir.unimas.my/id/eprint/17119/
http://ir.unimas.my/id/eprint/17119/
http://ir.unimas.my/id/eprint/17119/
http://ir.unimas.my/id/eprint/17119/1/Case%20Study%20University%20Lecture%20Timetabling%20Without%20Pre-registration%20Data%20%28abstract%29.pdf