Dynamic Timetable Generation Using Constraint Satisfaction Algorithm

Manual method of generating timetable has always been a time-consuming, laborious, and tedious task. It is neither efficient nor effective in terms of utilization of resources. The complicated relationships between time periods, classes (lectures), classrooms, and instructors (staff) make it difficult to attain a feasible solution. In this paper, timetabling problem is modeled as a constraint satisfaction problem. The algorithm dynamically builds the timetable adjusting resources in order of complexity. The main focus is to satisfy all the hard constraints and maximum soft constraints without any conflicts among resources. In order to reach a subsolution state, we use various heuristics that guide the search. Along with this, chronological backtracking and look-ahead techniques are also discussed. This software is ergonomic in nature as it also provides a way to alter the given inputs.