Timetable Scheduling using Bipartite Graph

Abstract: In any educational institution, the two most common academic scheduling problems are course timetabling and exam timetabling. A schedule is desirablewhich combines resources like teachers, subjects, students, classrooms in a way to avoid conflicts satisfying various essential and preferential constraints. The timetable scheduling problem is known to be NP Complete but the corresponding optimization problem is NP Hard. This problem is solved using bipartite graph. Hence a heuristic approach ispreferred to find a nearest optimal solution within reasonable running time