🧠
How AI scheduling works
5 min read
schedU treats your timetable as a constraint-satisfaction problem: you describe the rules, and the engine searches for an arrangement that satisfies every hard constraint while optimizing the soft ones.
Hard vs. soft constraints
Hard constraints must never be violated; soft constraints are preferences the engine optimizes toward.
- •Hard: no teacher or room double-booked, period counts met, electives run in parallel.
- •Soft: balanced teacher workloads, minimal gaps, subject spread across the week.
Period allocation
For each class, schedU distributes the required periods per subject across the week, avoiding back-to-back repetition where possible and respecting any timing rules you set (e.g. no PE in the first period).
Teacher allocation
Teachers are matched to subjects by expertise and assigned with workload balancing, so no one is overloaded and continuity rules (the same teacher across a year group) are honored.
💡 Regenerating is cheap — change a constraint and rebuild the whole timetable in seconds.