PENJADUALAN FLOWSHOP DENGAN ALGORITMA GENETIKA

Authors

  • Tessa Vanina Soetanto Faculty of Industrial Tehnology, Petra Christian University
  • Danny Prabowo Soetanto Faculty of Industrial Tehnology, Petra Christian University

DOI:

https://doi.org/10.9744/jti.1.1.1-11

Keywords:

flowshop, multiple objectives, genetic algorithm

Abstract

This paper explains and gives an application of genetic algorithm for flowshop scheduling at "X" company to reach minimum multiple objectives of makespan, total flowtime and machine idletime. Comparison to HC heuristic algorithm (Ho and Chang, 1991) is done to show the differences of genetic algorithm. Abstract in Bahasa Indonesia : Makalah ini menyajikan penjelasan dan contoh aplikasi dari algoritma genetika untuk penyelesaian masalah penjadualan flowshop di PT "X" dengan tujuan meminimumkan makespan, total flowtime, dan machine idletime secara bersama-sama. Selain itu untuk mengetahui keunggulan dari algoritma genetika juga dilakukan perbandingan terhadap algoritma heuristic HC (Ho and Chang, 1991). Kata kunci: flowshop, multiple objectives, algoritma genetika

Downloads

Download data is not yet available.

Downloads

Published

2004-07-01

How to Cite

[1]
T. V. Soetanto and D. P. Soetanto, “PENJADUALAN FLOWSHOP DENGAN ALGORITMA GENETIKA”, J. Tek. Ind. J. Keilmuan dan Apl. Tek. Ind., vol. 1, no. 1, pp. 1–11, Jul. 2004.

Issue

Vol. 1 No. 1 (1999): JUNE 1999

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).

Similar Articles

1 2 3 4 5 6 7 8 9 > >> 

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

Most read articles by the same author(s)