Penjadwalan Produksi Menggunakan Algoritma Heuristic Pour dan Palmer untuk Meminimasi Makespan pada CV Chandra Jaya

Abstract

CV. Chandra Jaya is a manufacturing company that produces furniture products, one of which is chairs and tables. The scheduling system implemented is using n job m processor series machines with the First Come First Serve method. Based on the research results, there was a delay in fulfilling orders in September, October 2023 and January February 2024 due to the high makespan value of the production floor. With the proposed Heuristic Pour and Heuristic Palmer Algorithm methods, it is hoped that the product completion time (makespan) will be shorter. The heuristic pour algorithm is carried out by placing all jobs in first place until the minimum makespan results are obtained. Meanwhile, the Palmer heuristic is carried out by sorting the slope index results from smallest to largest. The makespan obtained from the pour heuristic algorithm method is 71,27 hours, while the Palmer heuristic method is 76,50 hours. This shows that the heuristic pour algorithm was chosen as the best proposed method because it obtained minimal makespan results with a relative error of 12,74% with a job processing order of 3-2-4-1