AI Timetable Engine

The engine generates optimized, conflict-free timetables from a set of configurable constraints. No rule is hard-coded: every constraint lives in the database and is administrable from the interface, so each school sets its own pedagogical policy.

What it solves

• Internal vs. external teachers, including teachers who teach across several establishments and transfers between schools.
• Teacher availability and weekly hours per subject.
• No teacher in two classes at once; no class with two simultaneous courses.
• Available classrooms and laboratories, with equipment awareness.
• Subject constraints — e.g. don't teach a subject on two consecutive days.
• Precedence rules — some subjects must never come after others (e.g. physics not right after PE).
• Balanced spread of heavy vs. light subjects, and a cap on consecutive hours of the same subject.
• Breaks, recess and lunch; holidays and non-working days; locked time slots.

Configurable constraint rules

Schools express policy as data. For example:

• “Mathematics cannot be scheduled on two consecutive days.”
• “Physics can never immediately follow PE.”
• “French must always be taught before 11:00.”
• “A lab course must always be preceded by a theory course.”
• “An external teacher only teaches on Tuesday and Thursday.”
• “Primary pupils never have more than two heavy subjects in the same day.”
• “Computer rooms stay free on Friday afternoons.”

Beyond classic schedulers