This article presents a mixed-integer programming model for solving the university timetabling problem which considers the allocation of students to classes and the assignment of rooms and time periods to each class. The model was developed as part of our participation in the International Timetabling Competition 2019 and produced a ranking of second place at the competition. Modeling a timetabling problem as a mixed-integer program is not new. Our contribution rests on a number of innovative features adapted to this problem which allow for a reduction in the number of variables and constraints of the mixed-integer program to manageable levels achieving a reasonable computational performance. The proposed algorithm consists of a first-stage method to obtain an initial feasible solution and a second-stage local search procedure to iteratively improve the solution value, both of which involve the optimization of mixed-integer programming problems.

本文提出了一个混合整数规划模型，用于解决大学时间表问题，该模型考虑了学生的班级分配以及每个班级的房间和时间段的分配。该模型是我们参与 2019 年国际时间表比赛的一部分而开发的，并在比赛中排名第二。将时间表问题建模为混合整数程序并不新鲜。我们的贡献在于适应这个问题的许多创新特征，这些特征允许将混合整数程序的变量和约束减少到可管理的水平，从而实现合理的计算性能。