A binary linear programming model for a case study in university timetabling problem

Abstract

In this study, a university timetabling problem is addressed and proposed a two-phase approach for solving the problem. The timetabling problem is a combinatorial, NP-complete optimization problem. Due to its practicability and complexity, timetabling problem is prominent among the researchers and has sound literature equipped with various methodologies and solution techniques. Among the various timetabling problems, addressed in the literature, university course timetabling is more complex due to the sophisticated course structures, a large number of student groups, and many other requirements imposed by the institution. University timetabling problems can be hardly generalized due to the different inherent characteristics of the timetabling problem from institution to institution. And hence, many studies are focused on case studies while extending and generalizing to a certain extend. In this study, the timetabling for semester I of the Faculty of Science, University of Ruhuna, Sri Lanka is selected as a case study. Two-phase approach is proposed to produce the timetable.