Abstract :
At this time, any company engaged in manufacturing are forced to be more efficient to be able to compete.A Manufacturing system which has the job shop-type combinatorial optimization problems can be categorized into hard nondeterministic polynomial (NP-hard), meaning there can be found no exact algorithm that provide optimal solution. This study is using Differential Evolution algorithm (DE) to solve the existing problems. DE algorithm is a algorithm that uses the principles of evolutionary biology, such as the initialization of the population, the process of mutation, crossover, and selection process. In this study, the objectives are to minimize makespan and total direct labor costs. This research is a case study observing production process LPC 7253. This product is a reseach wardrobe that features 25 components that have to be done later called job. The results are obtained with the proposed scheduling produces makespan value of 221.17 hours, this is smaller than scheduling company amounted 279.5 hours. Thus reduction of scheduling donated by the DE algorithm is at 20.87%. Besides a decline in direct labor costs amounted to 14% from IDR 26,448,491.00 become IDR 22,724,723.00.
Keywords: Job Shop, Differential Evolution Algorithm, Makespan ¸ Total Direct labor Costs.