Publication: A mathematical model for course timetabling problem with faculty-course assignment constraints
Issued Date
2021-01-01
Resource Type
ISSN
21693536
Other identifier(s)
2-s2.0-85112768638
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
IEEE Access. Vol.9, (2021), 111666-111682
Suggested Citation
H. Algethami, W. Laesanklang A mathematical model for course timetabling problem with faculty-course assignment constraints. IEEE Access. Vol.9, (2021), 111666-111682. doi:10.1109/ACCESS.2021.3103495 Retrieved from: https://repository.li.mahidol.ac.th/handle/20.500.14594/76734
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
A mathematical model for course timetabling problem with faculty-course assignment constraints
Author(s)
Other Contributor(s)
Abstract
University course timetabling problem (UCTP) includes the challenging task of generating an automated timetable for courses under resource limitations. Manual generated timetables might hold some errors and consume a long time to create feasible solutions. Thus, there is a need to find optimal and fast solutions for this problem. The difficulty of the timetabling problem is further increased when tackling faculty-related constraints, according to their requirements, preferences, and availability. Thus, student-related constraints are usually the focus of UCTP generated solutions, in which faculty constraints are limited to their teaching load or preferences. This paper proposes a multi-objective mixed-integer programming model for a preregistration UCTP, combined with faculty-related constraints. The goal is to maximize events assignments and faculty-members preferences satisfaction while balancing the university requirements. At the same time, student learning days and unassigned events are minimized. The model is tested with eight real-world instances. Computational experiments are carried out to show the efficiency of the model. The proposed method can generate optimal timetables for all problem instances that satisfy faculty constraints.