A Study of Multi-Week Scheduling Scheme Based on Integer Programming

As the scale of universities continues to expand, the shortage of teaching resources and the need for personalized scheduling for teachers and students has become more pressing. This article addresses the problem of university scheduling by establishing a 0-1 integer programming model, which is solved using the GUROBI solver. The model satisfies various hard constraints and generates a multi-week university scheduling plan by utilizing the relationship between university scheduling weeks. In addition, multiple soft constraints are set to produce a higher-quality class schedule. This method was applied to the scheduling of a specific semester in the computer science department of a university. Through experimental, the method was found to be highly operable and practical, and to have a significant promoting effect on the establishment and optimization of automatic university scheduling systems.