Integrated Timetable Scheduling and Faculty Workload Management System Using Constraint Satisfaction Problem Modelling

Abstract: Managing academic class schedules and teaching assignments is a combinatorially complex problem that continues to challenge educational institutions worldwide. For school administrators, optimally assigning faculty to courses---while simultaneously balancing expertise, availability, and workload constraints---can require weeks of iterative trial and error. Although digital tools exist, many institutions still depend on fragmented spreadsheet-based processes. This paper presents a unified, web-based Integrated Timetable Scheduling and Faculty Workload Management System designed to address these challenges through formal Constraint Satisfaction Problem (CSP) modelling. The system leverages intelligent constraint enforcement, Minimum Remaining Value (MRV) heuristics, and forward-checking search strategies to generate conflict-free, balanced timetables efficiently. A real-time dynamic substitution algorithm handles faculty absences automatically by identifying optimal replacements based on subject expertise and current workload. The system was implemented as a fully functional web application --- the Academic ERP --- and validated through both algorithmic simulation and live system testing. Experimental evaluations confirm that the system eliminates scheduling conflicts entirely, reduces workload variance by approximately 85%, and generates timetables in under ten seconds on standard institutional hardware.

Keywords: Timetable Scheduling, Faculty Workload Management, Constraint Satisfaction Problem, CSP, Backtracking Search, MRV Heuristic, Substitute Allocation, Academic ERP, Educational Technology.