Education OR Optimization Toolkit

High-school course scheduling involves hundreds of classes, teachers, and rooms colliding across many constraints; manual adjustment takes weeks, and gets worse when staffing is tight. This toolkit models the problem mathematically and solves feasible schedules or class assignments automatically in minutes to ten-odd minutes — covering everything from regular scheduling to full elective-track assignment under the new gaokao (college entrance exam) system.

Google OR-Tools CP-SAT constraint solver. Hard constraints guarantee feasibility (resource exclusivity / teacher load / course distribution / fixed and forbidden slots); soft constraints are weighted for quality. Three layers of decision variables handle segment splitting and slot assignment; 8-thread parallel solving; 4 business modes: full elective / block elective / tiered / pre-assignment.