2nd Asia Pacific International Conference on Industrial Engineering and Operations Management

Heuristic Algorithm to Minimize Maximum Lateness for Job-shop Scheduling Problem in Automotive Industry

Docki Saraswati, Debbie Kemala Sari & Nesya Dwi Permata
Publisher: IEOM Society International
0 Paper Citations
1 Views
1 Downloads
Track: Production Planning and Management
Abstract

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.

Published in: 2nd Asia Pacific International Conference on Industrial Engineering and Operations Management, Surakarta, Indonesia

Publisher: IEOM Society International
Date of Conference: September 13-16, 2021

ISBN: 978-1-7923-6129-6
ISSN/E-ISSN: 2169-8767