New Variation of Exam Scheduling Problem Using Graph Coloring

Summary

In an academic institute, the academic calendar is one of the most important parts. The academic calendar is used to schedule all the events that occur in an academic year. In an academic year, there are various events such as semester starting date, course lesson plan, slot test, spring break or reading week, exam timetable, and the last day of the semester. An academic calendar has two important parts: (a) course timetable and (b) the exam schedule. The course timetable and the exam schedule both need a combination of resources like teachers, subjects, students, and classroom. In this study, we developed an algorithm for the new variation of exam schedule using graph coloring. In this algorithm, our aim was to use minimum resources in such a way to avoid conflicts by satisfying various necessary and priority limitations.