Algoritma Hybrid ACO-GA untuk Meminimumkan Makespan Penjadwalan Flowshop

Abstract

Flow shop scheduling is a ,scheduling mode! in which the job-job to be processed entirely flows in the same product direction/path. In other words, job-jobs have routing work together. Scheduling problems often arise if there is n jobs to be processed on the machine m, which must be specified which must be done first and how to allocate jobs on the machine to obtain a scheduled production process. in research of zini, H and ElBernoussi, S. (2016) NEH Heuristic and Stochastic Greedy Heuristic (SG) algorithms. This paper presents modified harmony search (HS) fir flow shop scheduling problems witi the aim of minimizing the maximum time of all jobs (makespan). To validate the proposed algorithm this computitaional test was performed using a sample dataset of 60 from the Taillard Benchmark The HS algorithm is compared with two constructive heuristics of the literature namely the NEH heuristic and stochastic greedy heuristic (SG). The experimental results were obtained on average for the dataset size of 20 x 5 to 50 x 10, that the ACO-GA algorithm has a smaller makespan than the other two algorithm, but for large-size datasets the ACO-GA algorithm has a greater makespan of both algorithms with difference of 1.4 units of time