Classroom scheduling problem with integer linear program

Abstract

In this project, we use an integer linear program to solve the classroom scheduling problem. We set the preference of time slots for each course. In this classroom scheduling, we expect that our result would be corresponding to the setup preference. Moreover, the result must follow some restrictions to make an efficient schedule such as class meetings chould not be assigned to busy rooms and each lecturer and each student must not have more than one class meeting at a time. We use the data of first-semester in 2019 of the Department of Mathematics and Computer Science, Faculty of Science, Chulalongkorn University as a case study. The data consist of courses with specified lecturers and available time slots of each room. Then we adjust data to make them easier for solving the problem in CPLEX Studio IDE software version 12.63 and Python version 3.7, which provide the classroom schedule under the constraints and the objective of maximizing overall preference.