ROBUST-HYBRID GENETIC ALGORITHM FOR A FLOW-SHOP SCHEDULING PROBLEM (A Case Study at PT FSCM Manufacturing Indonesia)

Authors

  • Johan Soewanda Alumnus, Faculty of Industrial Technology, Petra Christian University
  • Tanti Octavia Faculty of Industrial Technology, Petra Christian University
  • Iwan Halim Sahputra Faculty of Industrial Technology, Petra Christian University

DOI:

https://doi.org/10.9744/jti.9.2.144-151

Keywords:

robust, hybrid, genetic, algorithm, flow-shop.

Abstract

This paper discusses the application of Robust Hybrid Genetic Algorithm to solve a flow-shop scheduling problem. The proposed algorithm attempted to reach minimum makespan. PT. FSCM Manufacturing Indonesia Plant 4's case was used as a test case to evaluate the performance of the proposed algorithm. The proposed algorithm was compared to Ant Colony, Genetic-Tabu, Hybrid Genetic Algorithm, and the company's algorithm. We found that Robust Hybrid Genetic produces statistically better result than the company's, but the same as Ant Colony, Genetic-Tabu, and Hybrid Genetic. In addition, Robust Hybrid Genetic Algorithm required less computational time than Hybrid Genetic Algorithm

Downloads

Download data is not yet available.

Downloads

Published

2008-01-31

Issue

Vol. 9 No. 2 (2007): DECEMBER 2007

Section

Articles

License

Articles published in the Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri will be Open-Access articles distributed under the terms and conditions of the Creative Commons Attribution License (CC BY).


This work is licensed under a  Creative Commons Attribution License (CC BY).

How to Cite

[1]
“ROBUST-HYBRID GENETIC ALGORITHM FOR A FLOW-SHOP SCHEDULING PROBLEM (A Case Study at PT FSCM Manufacturing Indonesia)”, J. Tek. Ind. J. Keilmuan dan Apl. Tek. Ind., vol. 9, no. 2, pp. 144–151, Jan. 2008, doi: 10.9744/jti.9.2.144-151.

Similar Articles

1-10 of 92

You may also start an advanced similarity search for this article.

Most read articles by the same author(s)

1 2 > >>