Penjadwalan Produksi Produk Kursi Menggunakan Metode Algoritma Bee Colony untuk Meminimasi Makespan pada CV.Chandra Jaya

Abstract

In the production process, problems are often found, such as products reaching consumers not on time. Company scheduling can minimize costs and production time, so that orders are completed according to the agreed time. CV. Chandra Jaya is a manufacturing company that produces furniture products, one of which is guest chairs. The scheduling system applied is using a job m processor series machine with the Campbell Dudek and Smith method. Based on observations, there were delays in fulfilling orders in the periods April, May, September, November, December 2022. The high production processing time at certain stations causes the required completion time (makespan) on the production floor to increase. The improvement method used to solve the problems in this study is the bee colony algorithm method which has the advantage of finding alternative solutions close to optimum. The proposed method obtains lower makespan than the actual method with a relative error value of 15.58%. The actual makespan is 5,430.61 minutes with the production order Job A-Job B-Job C while the proposed method of the bee colony algorithm is 4,698.74 minutes with the production order Job A-Job C-Job B.