Integer Formulation and Data Analysis of a Real-World Course Timetabling Problem

Belonging to the class of hard combinatorial optimization problems, educational timetabling problems are considered to be challenging and attractive to operation research community in recent years. In this paper, we investigate a course timetabling problem in practice by introducing an integer formulation and data analysis of this problem. Fourteen data instances are taken from Faculty of Information Technology, University of Science in Vietnam. Thirteen measurements are used to analyze the hardness of these instances.