A GENETIC ALGORITHM APPROACH FOR SOLVING INBOARD OUTER FIXED LEADING EDGE-DRIVE RIB 1 PRODUCTION SCHEDULING AT PT DIRGANTARA INDONESIA

  • Heri Awalul Ilhamsah UTM
  • Indra Cahyadi UTM
  • Ari Yulianto UTM

Abstract

The scheduling of production floor is a sophisticated problem which seeks the optimal task allocation to certain resources under a number of constraints. The use of optimization techniques facilitates the determination of acceptable solutions that considered optimized for a specific problem. This paper proposes production scheduling solution based on job priority in a Non-Deterministic Polynomial-time hard (NP-hard) problem. The case study was taken from the Spirit Aerosystem Project, particularly in the Inboard Outer Fixed Leading Egde - Drive Rib 1 component production process. The problem consists of finding the machine operations schedule, taking into account the precedence constraints. The main objective is to minimize total delays or tardiness. The genetic algorithm was employed to determine the optimized production scheduling solution. The parameter for genetic operators in this study consists of a roulette wheel selection, 1 elitist chromosome, partially-mapped crossover mutation and 1 point mutation. The termination condition was achieved when there has been no improvement in the population for 30 iterations.The results show that the algorithm is capable to generate optimum production schedule with minimum tardiness for the given problem.


Keywords: Genetic algorithm, job shop problem, scheduling problem

Published
2018-05-21
How to Cite
ILHAMSAH, Heri Awalul; CAHYADI, Indra; YULIANTO, Ari. A GENETIC ALGORITHM APPROACH FOR SOLVING INBOARD OUTER FIXED LEADING EDGE-DRIVE RIB 1 PRODUCTION SCHEDULING AT PT DIRGANTARA INDONESIA. JOURNAL ASRO, [S.l.], v. 9, n. 1, p. 120-128, may 2018. ISSN 2722-5763. Available at: <https://asrojournal-sttal.ac.id/index.php/ASRO/article/view/109>. Date accessed: 25 apr. 2024. doi: https://doi.org/10.37875/asro.v9i1.109.
Keywords:
Genetic algorithm, job shop problem, scheduling problem