LLM stays in its lane
The model is only meant to turn plain-language constraints into structure. The timetable itself will come from a deterministic CP-SAT solver — and the product copy will say so plainly.
Case · AI · Optimization
Research toward school timetabling as a constraint problem — not something to hand an LLM.
School timetables are a constraint problem, not something an LLM should guess.
Solo — research and design
Ongoing: interviewing teachers and designing the solver before writing the first line of solver code.
Schools often buy timetable tools they only use a few times a year. The hard part is avoiding clashes across teachers, rooms, classes, and rules. That is a constraint problem — so the plan is to solve it with an OR-Tools CP-SAT solver, not guess it with an LLM that cannot guarantee a clash-free result.
The model is only meant to turn plain-language constraints into structure. The timetable itself will come from a deterministic CP-SAT solver — and the product copy will say so plainly.
OR-Tools (Apache-2.0) is the planned solver over strong alternatives like FET, whose AGPL licence would force the whole product open-source.
The design calls for a separate verifier that re-checks every timetable against the full rule set, rather than trusting the solver's own feasibility result.
A scheduling tool grounded in how schools really work, honest about using a solver — not an LLM — for the part that has to be correct. The research phase is shaping what gets built first.