Pengembangan Algoritma Hybrid Flowshop Three-Stage Dengan Mempertimbangkan Waktu Setup

Dana Marsetiya Utama, Annisa Kesy Garside, Wahyu Wicaksono



Hybrid flow shop scheduling is one topic that is often reviewed by researchers at this time. Hybrid flow shop scheduling is the development of problems from pure flow shop. Flow shop problems have one machine at each stage. In this problem, each stage of operation has a machine that is arranged in parallel. This article aims to discuss the issue of hybrid flow shop scheduling at three stage to minimize makespan. Some previous studies discussed scheduling problems by considering setup time. However, such research is generally for the problem of pure flow shop. Therefore, a new algorithm is proposed to solve the problem. The proposed algorithm is developed from the Pour heuristic algorithm. Several experiments were conducted to determine the performance of the proposed algorithm. This study uses ten numerical experiments. This experiment uses the number of jobs varying from 5 jobs to 50 jobs. The results of numerical experiments show that the proposed algorithm has better performance compared to some other algorithms. The proposed method produces an effective solution if it is used to solve problems with a large number of jobs..


scheduling, hybrid flow shop three stages, algorithm, setup time

Full Text:



Abdel-Basset, M.; Manogaran, G.; El-Shahat, D.; Mirjalili, S. (2018). "A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem". Future Generation Computer Systems, 85, 129-145.

Aldowaisan, T.; Allahverdi, A. (2004). "New heuristics for m-machine no-wait flowshop to minimize total completion time". Omega, 32 (5), 345-352.

Allahverdi, A.; Al-Anzi, F.S. (2006). "A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times". European Journal of Operational Research, 169 (3), 767-780.

Allahverdi, A.; Aldowaisan, T. (2000). "No‐wait and separate setup three‐machine flowshop with total completion time criterion". International Transactions in Operational Research, 7 (3), 245-264.

Ebrahimi, M.; Ghomi, S.F.; Karimi, B. (2014). "Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates". Applied Mathematical Modelling, 38 (9-10), 2490-2504.

Firdaus, M.; Masudin, I.; Utama, D.M. (2015). "Penjadwalan flowshop dengan menggunakan simulated annealing". Spektrum Industri, 13 (1), 27-40.

Gómez-Gasquet, P.; Andrés, C.; Lario, F.-C. (2012). "An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan". Expert Systems with Applications, 39 (9), 8095-8107.

Harto, S.; Garside, A.K.; Utama, D.M. (2016). "Penjadwalan produksi menggunakan algoritma jadwal non delay untuk meminimalkan makespan studi kasus di CV. Bima Mebel". Spektrum Industri, 14 (1), 79-88.

Husen, M.; Masudin, I.; Utama, D.M. (2015). "Penjadwalan job shop statik dengan metode simulated annealing untuk meminimasi waktu makespan". Spektrum Industri, 13 (2), 115-124.

Lin, S.-W.; Gupta, J.N.; Ying, K.-C.; Lee, Z.-J. (2009). "Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times". International Journal of Production Research, 47 (12), 3205-3217.

Marichelvam, M.K.; Prabaharan, T.; Yang, X.S. (2014). "A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems". IEEE Transactions on Evolutionary Computation, 18 (2), 301-305.

Masudin, I.; Utama, D.M.; Susastro, F. (2014). "Penjadwalan flowshop menggunakan algoritma Nawaz enscore HAM". Jurnal Ilmiah Teknik Industri, 13 (1), 54-59.

Nasution, R.; Garside, A.K.; Utama, D.M. (2017). "Penjadwalan job shop dengan pendekatan algoritma artificial immune system". Jurnal Teknik Industri, 18 (1), 29-42.

Ong, J.O. (2013). "Penjadwalan non-delay melalui mesin majemuk untuk meminimumkan makespan". Spektrum Industri, 11 (2), 185-195.

Pour, H.D. (2001). "A new heuristic for the n-job, m-machine flow-shop problem". Production Planning & Control, 12 (7), 648-653.

Proust, C.; Gupta, J.; Deschamps, V. (1991). "Flowshop scheduling with set-up, processing and removal times separated". The International Journal Of Production Research, 29 (3), 479-493.

Ruiz, R.; Stützle, T. (2008). "An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives". European Journal of Operational Research, 187 (3), 1143-1159.

Soetanto, T.V.; Palit, H.C.; Munika, I. (2005). "Studi perbandingan performance algoritma heuristik Pour terhadap mixed integer programming dalam menyelesaikan penjadwalan flowshop". Jurnal Teknik Industri, 6 (1), pp. 79-85.

Sulaksmi, A.; Garside, A.K.; Hadziqah, F. (2014). "Penjadwalan produksi dengan algoritma heuristik Pour (Studi kasus: Konveksi One Way–Malang)". Jurnal Teknik Industri, 15 (1), 35-44.

Utama, D.M. (2018). Pengembangan Algoritma NEH Dan CDS Untuk Meminimasi Consumption Energy Pada Penjadwalan Flow Shop. Paper presented at the Prosiding SENTRA (Seminar Teknologi dan Rekayasa), Malang.

Utama, D.M. (2019). "An effective hybrid sine cosine algorithm to minimize carbon emission on flow-shop scheduling sequence dependent setup". Jurnal Teknik Industri, 20 (1), 10.

Utama, D.M.; Widodo, D.S.; Wicaksono, W.; Ardiansyah, L.R. (2019). "Metaheuristics algorithm for minimizing energy consumption in the flow shop scheduling problem". International Journal of Technology, 10 (2), 320-331.

Widodo, D.S. (2017). "Pengembangan Cross Entropy-Genetic Algorithm (CEGA) pada penjadwalan model flow shop untuk meminimalkan makespan". Teknoterap, 1 (1), 1–11.

Ying, K.-C.; Lin, S.-W. (2018). "Minimizing makespan for no-wait flowshop scheduling problems with setup times". Computers & Industrial Engineering, 121, 73-81.

Zandieh, M.; Karimi, N. (2011). "An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times". Journal of Intelligent Manufacturing, 22 (6), 979-989.

Article Metrics

Abstract view(s): 395 time(s)
PDF: 380 time(s)


  • There are currently no refbacks.