Mathematical Model for Scheduling Problems: A Compatibility Test on University Course Timetabling Problem

Abstract

AbstractThe study presents the application of a general mathematical model previously developed for another set of timetabling problem which is the University Course Timetabling (UCT). The aim of this study is to extend the validation process of the formulated model using a standard Mixed Integer Linear Programming (MILP). A real public university course timetabling problem was used as our case study. All data was gathered and analysed before embedded to the general model and solved optimally using the AIMMS mathematical software with CPLEX as the solver to a personal laptop of 2.20 GHz and 4.95 GB RAM. The data consists of 27 programmes, 449 core courses, 59 rooms and 70 time slots. An optimal standard university course timetable was produced within a few minutes of CPU time. Optimality denotes that the courses were assigned to the preferred slots and rooms, while fulfilling requirements such as the university’s policies, and other demands of all parties involved. With the timetable produced, it is proven of the capability of the mathematical model developed in solving timetabling problems.KeywordsSchedulingManagement problemUniversity course timetableGeneral mathematical model