Robust-Hybrid Genetic Algorithm For A Flow-Shop Scheduling Problem (A Case Study At Pt Fscm Manufacturing Indonesia)  

Oleh:

Octavia, Tanti ; Sahputra, Iwan Halim ; Soewanda, Johan

Jenis: Article from Journal - ilmiah nasional - terakreditasi DIKTI - non-atma jaya
Dalam koleksi: Jurnal Teknik Industri vol. 9 no. 2 (Dec. 2007), page 144-151.
Topik: robust; hybrid; genetic; algorithm; flow-shop.
Fulltext: 144.pdf (229.3KB)

Isi artikel

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.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali