An automated timetable generator that produces conflict-free schedules given faculty, room, and course constraints using constraint-satisfaction techniques.
An automated timetable generator that takes a description of faculty availability, rooms, courses, and class sizes and produces a full conflict-free schedule. Instead of the manual spreadsheet shuffle, the tool formulates the problem as a constraint-satisfaction problem and lets a solver find a valid assignment — or tell you cleanly when no assignment exists.
Academic timetabling is painful: a single faculty clash invalidates the whole grid, and what looks like a small change (swap a room, add a course) cascades into hours of manual re-work. Humans also tend to produce locally-valid timetables that violate soft preferences — nobody wants their first class at 8 a.m. five days a week. A solver-based approach handles hard constraints by construction and can optimize soft preferences on top.