1Department of Mathematics, Rabindranath Tagore University, Bhopal (M.P), India
2Department of Mathematics, Lakshmi Narain College of Technology & Science, Bhopal (M.P), India
*E-mail: vaishvik.gangrade@gmail.com
**bhawnakhushiagrawal@gmail.com
Online published on 3 January, 2025.
At the post graduate level, graph coloring proves to be a successful method for time table scheduling. In order to achieve fairness, accuracy, and the ideal course time period, this work introduces an oval method for timetable scheduling utilizing graph-coloring based algorithm. Through the process, we take a few limitations into account, such as the amount of rooms, periods, and credits, etc. In this paper, we offer a straightforward solution to the issue of time tabling in postgraduate programs. Following the majority of typical requirements, our method can deliver realizable outcomes in less time. Time tabling is the most common issue college students encounter, and there is currently no workable system designed to create a course schedule while considering numerous constraints like faculty, periods, rooms.
Time table scheduling, Graph algorithms, Graph coloring, NP-hard problem, NGC algorithm