PERBANDINGAN KINERJA ALGORITMA GENETIKA DAN SIMULATED ANNEALING UNTUK MASALAH MULTIPLE OBJECTIVE PADA PENJADWALAN FLOWSHOP
The research is focused on comparing Genetics algorithm and Simulated Annealing in the term of performa and processing time. The main purpose is to find out performance both of the algorithm to solve minimizing makespan and total flowtime in a particular flowshop system. Performances of the algorith...
Main Authors: | I Gede Agus Widyadana, Andree Pamungkas |
---|---|
Format: | Article |
Language: | English |
Published: |
Petra Christian University
2002-01-01
|
Series: | Jurnal Teknik Industri |
Subjects: | |
Online Access: | http://puslit2.petra.ac.id/ejournal/index.php/ind/article/view/16008 |
Similar Items
-
PENJADWALAN FLOWSHOP DENGAN MENGGUNAKAN SIMULATED ANNEALING
by: Muhammad Firdaus, et al.
Published: (2015-04-01) -
PENJADWALAN JOB SHOP STATIK DENGAN METODE SIMULATED ANNEALING UNTUK MEMINIMASI WAKTU MAKESPAN
by: Moh.Husen, et al.
Published: (2015-10-01) -
Effective Design of the Simulated Annealing Algorithm for the Flowshop Problem with Minimum Makespan Criterion
by: Jarosław Hurkała, et al.
Published: (2012-06-01) -
STUDI PERBANDINGAN PERFORMANCE ALGORITMA HEURISTIK POUR TERHADAP MIXED INTEGER PROGRAMMING DALAM MENYELESAIKAN PENJADWALAN FLOWSHOP
by: Tessa Vanina Soetanto, et al.
Published: (2004-01-01) -
Multiobjective Variable Neighborhood Search algorithm for scheduling independent jobs on computational grid
by: S. Selvi, et al.
Published: (2015-07-01)