A General Mathematical Model for University Courses Timetabling: Implementation to a Public University in Malaysia
Keywords:University course timetabling problem, Scheduling, Management problem, Integer programming, Mathematical model
AbstractUniversity course timetabling is a well-known management problem amongst researchers, thus the rich body of literature. However, published articles are mainly on improved solution approaches leads to presentation on different constraints used and ignoring human preferences. This however, limits the model application to other universities. The research aims to bridge the gap by acknowledging these varieties of demands. In the process of generating our mathematical model, we have gone through meticulously researches that have been carried out in the past years to determine the demands of individuals involved directly with the timetable. The varieties of demands were clarified from a survey conducted. An improvised UCTP model was developed, which involves a superset of constraints that also includes the users’ preferences. However, we will extensively discuss on the list of requirements obtained from the survey and demonstrate the requirements that were found acceptable to be considered in a general mathematical model. To verify the compatibility of our mathematical model, we illustrate with real data from a university in Malaysia. The experimental result confirms the applicability of our mathematical model towards real problem. We expect that this model could be in favor of solving other university course timetabling problem with slight modifications.
N. L. Lawrie, “An Integer Linear Programming Model of a School Timetabling Problem,” The Computer Journal, vol. 12, no. 4, pp. 307-316, 1969.
S. Daskalaki, T. Birbas, and E. Housos, “An Integer Programming Formulation for a Case Study in University Timetabling,” European Journal of Operational Research, vol. 153, no. 1, pp. 117-135, 2004.
S. Daskalaki, and T. Birbas, “Efficient Solutions for a University Timetabling Problem Through Integer Programming,” European Journal of Operational Research, vol. 160, no. 1, pp. 106-120, 2005.
S. Ribić, and S. Konjicija, “A Two Phase Integer Linear Programming Approach to Solving the School Timetable Problem,” in Proceedings of the ITI 2010, 32nd International Conference on Information Technology Interfaces, IEEE, pp. 651-656, 2010.
V. O. Oladokun, and S. O. Badmus, “An Integer Linear Programming Model of a University Course Timetabling Problem,” The Pacific Journal of Science and Technology, vol. 9, no. 2, 2008.
S. A. Mirhassani, “A Computational Approach to Enhancing Course Timetabling with Integer Programming,” Applied Mathematics and Computation, vol. 175, no. 1, pp. 814-822, 2006.
N. Boland, B. D. Hughes, L. T. Merlot, and P. J. Stuckey, “New Integer Linear Programming Approaches for Course Timetabling,” Computers & Operations Research, vol. 35, no. 7, pp. 2209-2233, 2008.
N. A. H. Aizam, and L. Caccetta, “Computational Model For Timetabling Problem,” Numerical Algebra, Control and Optimization, vol. 4, no. 1, pp.269-285, 2014.
N. L. Abdul Aziz, and N. A. H. Aizam, “University Course
Timetabling and the Requirements: Survey in Several Universities in the East-Coast of Malaysia,” in AIP Conference Proceedings, AIP Publishing, vol. 1870, no. 1, pp. 040013, 2017.
N. L. A. Aziz, and N. A. H. Aizam, “A brief review on the features of university course timetabling problem,” in AIP Conference Proceedings, AIP Publishing LLC, vol. 2016, no. 1, pp. 020001, 2018.
Copyright (c) 2022 Zahidah Mohd Zaulir, Nurul Liyana Abdul Aziz, Nur Aidya Hanum Aizam
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.