Validating the Adaptability of a Developed General University Course Timetabling Model through Practical Implementation
DOI:
https://doi.org/10.11113/mjfas.v22n1.4443Keywords:
AIMMS, Management problem, Mathematical model, Mixed-integer programming, SchedulingAbstract
Researchers have extensively studied the university course timetabling problem (UCTP) over the past decades, aiming to develop efficient, practical, and scalable scheduling that cater to the needs of academic institutions. This paper presents the implementation of a general Mixed-Integer Programming (MIP) model to solve UCTP using a dataset from an East Coast Malaysian public university. Building upon previous research that proposed a model with 24 constraints, this study aims to validate the original model to ensure its applicability and flexibility. Through the validation process, this study demonstrates how the model can be customized by selecting 13 relevant constraints based on East Coast Malaysian public university’s specific scheduling requirements, institutional policies, and academic preferences. This approach ensures that the model remains both realistic and adaptable to various scheduling contexts. Two different case studies with the same dataset are explored: case study 1 focuses on generating a timetable based on the university’s real timetabling requirements, while case study 2 integrates additional preferences and requests from lecturers and top university management to accommodate specific needs. The model is solved using AIMMS with the CPLEX 12.9 solver, ensuring feasible and optimal solutions. With minor modifications, this general model is adaptable and applicable to other universities' while addressing various institutional requirements and preferences.
References
Vangerven, B., Ficker, A. M., Goossens, D. R., Passchyn, W., Spieksma, F. C., & Woeginger, G. J. (2018). Conference scheduling—a personalized approach. Omega, 81, 3847.
Martínez-de-Albéniz, V., & Valdivia, A. (2019). Measuring and exploiting the impact of exhibition scheduling on museum attendance. Manufacturing & Service Operations Management, 21(4), 761779.
Rappos, E., Thiémard, E., Robert, S., & Hêche, J. F. (2022). A mixed-integer programming approach for solving university course timetabling problems. Journal of Scheduling, 25(4), 391404.
Jamaluddin, N. F., & Aizam, N. A. H. (2017). Examination Timetabling Problem: A Case Study. Indian Journal of Science and Technology, 10, 31.
Dinh, M. H., Kotary, J., Gouldin, L. P., Yeoh, W., & Fioretto, F. (2024). End-to-End Optimization and Learning of Fair Court Schedules. arXiv preprint arXiv:2410.17415.
Xu, X., Li, C. L., & Xu, Z. (2021). Train timetabling with stop-skipping, passenger flow, and platform choice considerations. Transportation Research Part B: Methodological, 150, 5274.
Qi, J., Chen, T., Zheng, J., & Wang, S. (2023). Port Call Optimization at a Ferry Terminal with Stochastic Servicing Time and Additional Visits. Journal of Marine Science and Engineering, 11(9), 1644.
Yan, S. Y., Lu, C. C., & Wu, C. L. (2015). An airline flight scheduling model considering time slot allocation and variable demand. Journal of the Chinese Institute of Civil and Hydraulic Engineering, 27(2), 93104.
Ying, C., & Liebson, M. (2024). An Innovative Approach to Optimize Inbound Delivery Scheduling at Distribution Centers: Application at a Large US Restaurant Chain. International Journal of Operations Research and Information Systems (IJORIS), 15(1), 121.
Lamiri, M., Xie, X., Dolgui, A., & Grimaud, F. (2008). A stochastic model for operating room planning with elective and emergency demand for surgery. European Journal of Operational Research, 185(3), 10261037.
Cubillas, J. J., Ramos, M. I., Feito, F. R., & Ureña, T. (2014). An improvement in the appointment scheduling in primary health care centers using data mining. Journal of medical systems, 38(8), 89.
Vakratsas, D., & Naik, P. A. (2007). Essentials of Planning Media Schedules. The SAGE Handbook of Advertising, 333348.
Long, X., & Zhao, J. (2020). Scheduling problem of movie scenes based on three meta-heuristic algorithms. IEEE Access, 8, 5909159099.
Durán, G., Guajardo, M., & Gutiérrez, F. (2022). Efficient referee assignment in Argentinean professional basketball leagues using operations research methods. Annals of Operations Research, 119.
Soong, C. J., Ramli, R., & Ibrahim, H. (2011). A hybrid constraint-based programming approach to design a sports tournament scheduling. European Journal of Scientific Research, 49(1), 3948.
Zaulir, Z. M., Aziz, N. L. A., & Aizam, N. A. H. (2022). A general mathematical model for university courses timetabling: Implementation to a public university in Malaysia. Malaysian Journal of Fundamental and Applied Sciences, 18(1), 8294.
Gunawan, A., Ng, K. M., & Poh, K. L. (2006, June). A Mathematical Programming Model for a Timetabling Problem. In CSC (pp. 4247).
Pereira, V., & Gomes Costa, H. (2016). Linear integer model for the course timetabling problem of a faculty in Rio de Janeiro. Advances in Operations Research, 2016(1), 7597062.
Arratia-Martinez, N. M., Maya-Padron, C., & Avila-Torres, P. A. (2021). University course timetabling problem with professor assignment. Mathematical Problems in Engineering, 2021(1), 6617177.
Al-Yakoob, S. M., Sherali, H. D., & Al-Jazzaf, M. (2010). A mixed-integer mathematical modeling approach to exam timetabling. Computational Management Science, 7, 1946.
Algethami, H., & Laesanklang, W. (2021). A mathematical model for course timetabling problem with faculty-course assignment constraints. IEEE Access, 9, 111666111682.
Rappos, E., Thiémard, E., Robert, S., & Hêche, J. F. (2022). A mixed-integer programming approach for solving university course timetabling problems. Journal of Scheduling, 25(4), 391404.
Abdellahi, M., & Eledum, H. (2017). The university timetabling problem: modeling and solution using binary integer programming with penalty functions. International Journal of Applied Mathematics and Statistics, 56(6), 164178.
AlHadid, I., Kaabneh, K., Tarawneh, H., & Alhroob, A. (2020). Investigation of simulated annealing components to solve the university course timetabling problem. Italian Journal of Pure and Applied Mathematics, 44, 282290.
Badoni, R. P., Sahoo, J., Srivastava, S., Mann, M., Gupta, D. K., Verma, S., & Karabašević, D. (2023). An exploration and exploitation-based metaheuristic approach for university course timetabling problems. Axioms, 12(8), 720.
Arostegui Jr, M. A., Kadipasaoglu, S. N., & Khumawala, B. M. (2006). An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems. International Journal of Production Economics, 103(2), 742754.
Chen, M., Tang, X., Song, T., Wu, C., Liu, S., & Peng, X. (2020). A Tabu search algorithm with controlled randomization for constructing feasible university course timetables. Computers & Operations Research, 123, 105007.
Fausto, F., Reyna-Orta, A., Cuevas, E., Andrade, Á. G., & Perez-Cisneros, M. (2020). From ants to whales: metaheuristics for all tastes. Artificial Intelligence Review, 53, 753810.
Toaza, B., & Esztergár-Kiss, D. (2023). A review of metaheuristic algorithms for solving TSP-based scheduling optimization problems. Applied Soft Computing, 148, 110908.b
Benli, O. S., & Botsali, A. R. (2004). An optimization-based decision support system for a university timetabling problem: An integrated constraint and binary integer programming approach. Computers and Industrial Engineering, 129.
Aizam, N. A., & Liong, C. Y. (2013). Mathematical modelling of university timetabling: a mathematical programming approach. International Journal of Applied Mathematics and Statistics, 37(7), 110122.
Aizam, N. A. H., & Caccetta, L. (2014). Computational models for timetabling problem. Numerical Algebra, Control & Optimization, 4(3), 269.
Aizam, N. A. H., Aziz, N. L. A., & Zaulir, M. Z. (2019). New general university course timetabling model towards real problems: a comparison. Journal of Advanced Research in Dynamical and Control Systems, 11(12-Special Issue), 244257.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Nur Aidya Hanum Aizam, Siti Sarah Mohd Rohaizad, Zahidah Mohd Zaulir
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
