An automotive manufacturing company producing die and stamping products. Job-shop is a pattern of product flow that applies, because products have a variety of shapes, sizes and different designs. The purpose of this research is to design a scheduling using an active schedule algorithm and a non-delay schedule algorithm. The algorithm supported by the python programming language. Job shop scheduling pattern with 17 jobs and 10 stamping machines. Scheduling performance used is to minimize the maximum lateness, makespan and mean lateness. Based on the research results, the non-delay schedule algorithm can reduce the maximum lateness by 16.81% compared to the active schedule algorithm approach.
Heuristic Algorithm to Minimize Maximum Lateness for Job-shop Scheduling Problem in Automotive Industry
3 Views
4 Downloads