Optimasi Sistem Penjadwalan Dengan Implementasi Algoritma Welch Powell Pada Sistem Penjadwalan Customer Service Di Gerai Indosat Ooredoo Cabang Kuta

Abstract

The purpose of this research was to solve the problems related to the optimization of the customer service scheduling system in Indosat Ooredoo Office Kuta Branch by implementing the concept of graph coloring, namely the application of the Welch Powell algorithm. This research was a case study. Data obtained from observations and interviews. The data analyzed is a pre-existing customer service scheduling system. The scheduling system obtained will be analyzed further by using Welch Powell's algorithm to solve problems related to the formation of mobile selling teams and its schedule. Before being analyzed using the Welch Powell algorithm, the scheduling system is represented in graph form. There was a Welch Powell algorithm that is 1) Sort the vertices of G in decreasing degrees; 2) Use one color to color the first node (which has the highest degree) and other vertices that do not match the first node; 3) Start again with the next highest degree node in the ordered list that has not been colored and repeat the process of node transfer using the second color. Based on the results of the analysis, the number of existing customer services can be formed into three teams with alternating mobile selling schedules in one week. This is more efficient than the previous scheduling system that determined the mobile selling team based on the employee's work shift. Based on this, the implementation of the Welch Powell algorithm can solve the problem of scheduling system optimization in the Indosat Ooredoo Customer Service Division of the Kuta Branch theoretically.