Archives

New General University Course Timetabling Model Towards Real Problems: A Comparison


Nur Aidya Hanum Aizam, Nurul Liyana Abdul Aziz, Zahidah Mohd Zaulir
Abstract

The university course timetabling problem is the process of allocating courses, which are taught by lecturers and attended by student groups, into room-slots, considering hard and soft constraints. Previously, a generalized mathematical model for university course timetabling has been developed by using mixed-integer linear programming. However, in generating the model, we observed the literature to identify the constraints that are neglected, at the same time constructing several soft constraints that could be of demand by the timetabling community. In this study, we will present a more general model for university course timetabling which involves a set of constraints. This approach is illustrated with real data from a Tunisian university. This paper divides the timetabling problem into 2; case study 1 and case study 2. In case study 1, we introduce an ILP approach that considers all the features as in the previous study and the constructed timetable is compared with those produced by THA heuristic. Meanwhile, in case study 2, a new general university course timetabling model is presented. We implement and test our model by AIMMS with CPLEX 12.6.3 as the solver.

Volume 11 | 12-Special Issue

Pages: 244-257