Graph Coloring based Optimized Algorithm for Resource Utilization in Examination Scheduling

Time table scheduling in any organization requires efficient allocation of constrained resources in an organized manner so that no conflict arises. This paper presents a novice method for optimized utilization of resources (for e.g. rooms, teachers, and time slots etc.) in an examination timetable using graph coloring, which clearly shows how examination can be scheduled efficiently. The approach designed in this paper has been discussed in two parts. Under first approach, examinations are removed from the independent set obtained by graph coloring if the total students in examinations are more than the available seats, in all rooms of the institution. The second approach describes adjustments of removed examinations into other independent sets to minimize the total time slots used. The designed scheme works successfully under some assumptions and constrained which are duly mentioned in the proposed approach