A Curriculum Scheduling System Based on Pooling Algorithm

Curriculum scheduling is an important and complicated work in schools. It´s a complex problem to be resolved with multiple constraints. So to solve the problem is of great importance for teaching programming. In this paper, we mainly discussed the timetable problem of middle and high schools in teaching management. Investigated and studied the algorithm existed. Deserted the complex algorithm does not fit into the reality, while synthesized and developed the algorithm that fits into the reality to form the feasible algorithm, the pooling algorithm based on priority. The method was tested with real-world data sets and the result was satisfactory. The algorithm is reasonable and easy to be utilized.