PENERAPAN PEWARNAAN GRAF PADA PENJADWALAN UJIAN TAHFIDZ MENGGUNAKAN ALGORITMA WELCH POWELL

Abstract

The case study in this research is the application of graph coloring in scheduling Tahfidz exams at SDIT Al Amanah in North Jakarta using the Welch Powell algorithm. The problem frequently encountered in exam scheduling is conflicts between examiners and the classes they teach. The implementation of the graph in this study assumes that classes are nodes, while edges connecting two nodes represent two classes taught by the same examiner. The results obtained indicate that the Welch Powell algorithm can be applied to schedule practical Tahfidz exams at SDIT AL Amanah with a minimum required number of 6 sessions. The implementation results demonstrate that the scheduling system for practical Tahfidz exams using the Welch Powell algorithm successfully generates a schedule without any overlapping in the execution time.