Optimasi Penjadwalan Mesin Seri untuk Meminimalkan Makespan Menggunakan Metode Dynamic Programming

Abstract

The furniture industry faces challenges in meeting high market demand, primarily due to suboptimal production scheduling. This research aims to optimize wardrobe production scheduling at Karangsari Furniture to minimize makespan (total completion time) using the Dynamic Programming (DP) method. The company's current method, Campbell Dudek Smith (CDS), is compared with the proposed dynamic programming approach to evaluate efficiency. Data was collected through direct observation and document studies, encompassing process times, rating factors, allowances, and product demand. Time measurements were validated through tests for data uniformity and sufficiency. Analysis results show the actual makespan was 190.929 hours with the sequence Job A-B-C, whereas dynamic programming yielded a makespan of 169.576 hours with the optimal sequence Job B-C-A. An Efficiency Index (EI) value of 1.139 proves the superiority of dynamic programming compared to CDS. The conclusion of this research affirms that dynamic programming is effective in reducing makespan and production delays. Implementing dynamic programming can enhance production floor efficiency and customer satisfaction. Recommendations for the company include adopting dynamic programming for routine scheduling and exploring other methods for further development. This research contributes to the operational literature of the furniture industry with a dynamic programming-based optimization approach.