Abstract: The planning problem that arises in a school providing additional educational services is considered. The school o ers various language courses depending on the level of knowledge of the students. The work schedule is formed on the basis of applications from potential students, which indicate free days and hours for classes. During the construction of schedule, students are grouped together, assigned class times, rooms, and one teacher. The school's goal is twofold: to maximize the number of students attending while maintaining a high average number of students per class. We have proposed a mathematical model of the described problem in terms of integer linear programming and proposed a VNS based approach for solving the problem. This work presents the results of comparing the proposed approach and a commercial MIP solver. The calculations were based on synthetic data based on real data.

Cite: Davydov I. , Lyapin A.
Variable neighborhood search approcah for additional education school timetabling
XXIV International conference “Mathematical Optimization Theory and Operations Research” 07-11 июл. 2025