Scheduling Model Based on Maximum Satisfaction

Abstract

Objective This paper mainly studies the curriculum arrangement problem of multi-teacher, multi-subject and multi-class, establishes a 0-1 programming model, and uses the linear programming method to solve the problem, based on the actual use of optimization software. Method The method adopted in this paper is to assign different course arrangement satisfaction to different course types in different sessions, with the goal of maximizing the satisfaction of all course arrangements, fully considering the actual constraints, establishing a linear programming model, and transforming the course scheduling problem into a 0-1 planning problem. Result In this paper, 48 teachers are selected to undertake the teaching tasks of 21 subjects in 19 classes for verification, and the software quickly obtains the global optimal solution, which solves the problem that the global optimal solution cannot be obtained for large-scale problems with conventional class scheduling algorithms. Conclusion By setting different satisfaction values, the global optimal solution of the class scheduling problem can be quickly obtained with the help of optimization software, and the course arrangement scheme corresponding to the maximum satisfaction can be obtained.