PENJADUALAN FLOWSHOP DENGAN ALGORITMA GENETIKA

PENJADUALAN FLOWSHOP DENGAN ALGORITMA GENETIKA

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

Full description

Bibliographic Details
Main Authors: Danny Prabowo Soetanto, Tessa Vanina Soetanto
Format: Article
Language:English
Published: Petra Christian University 1999-01-01
Series:Jurnal Teknik Industri
Subjects:
flowshop
multiple objectives
genetic algorithm
Online Access:http://puslit2.petra.ac.id/ejournal/index.php/ind/article/view/15976
Description
Summary: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
ISSN:1411-2485

Similar Items