MAKESPAN MINIMIZATION IN BATIK MURNI SMEs WITH PALMER, CAMPBELL DUKDEK SMITH, AND HEURISTIC POUR ALGORITHM

Abstract

Batik Murni is one of the Small and Medium Enterprises (SMEs) in Madiun that produces batik tulis and batik cap. This SMEs still uses intuition to make the production schedule. This condition can give disadventages for the SMEs, overstock and stockout will be happened. In this study, the researchers want to offer a solution for the scheduling problems so Batik Murni can increase their productivity performance. Researchers offer three production scheduling methods aim to minimize the makespan of Batik Tulis. Makespan is used as a parameter in this study because when it can be minimized so the each time (processing time, setup time, flow time, ect) in the workstation can be minimized too. In this case, the best method that have the minimum makespan has the important role to know when the job can be started and ended. The three methods used are Palmer, Champbell Dukdek Smith (CDS), and Heuristic Pour Algorithm. From this research, it can be concluded that the best production scheduling optimization at Batik Murni SMEs is obtained from the Palmer method. With makespan of 4837 minutes or 11 days so the makespan can be minimized 54,2%. In the order of the production process is batik sejuta bunga – batik batik turi tabur - batik seger arum - batik pecel.

Keywords

• scheduling
• makespan
• palmer
• cds
• heuristic pour algorithm