Graph Coloring Applications in Scheduling Courses using Welch-Powell Algorithm - A Case Study

Abstract

Subject scheduling is a routine activity carried out by each school before the start of the new school year, so the subject schedule is arranged in such a way, so that there are no identical or conflicting schedules, and no teachers teach at the same time and class. The preparation of the first-semester subject schedule for the 2021/2022 academic year at SMPN 2 Sungai Rumbai, Dharmasraya Regency is one of the problems in graph coloring, this problem will be solved using the Welch-Powell algorithm. This arrangement is done by representing the data in the form of a graph, so that neighboring vertices are obtained. Next, apply the Welch-Powell algorithm to the coloring of graph vertices to obtain chromatic numbers, which means that vertices with the same color can be scheduled together so that the arrangement of the subject schedule can be scheduled on the same day and class.