The Moth-Flame Optimization Algorithm for Flow Shop Scheduling Problem with Travel Time
DOI:
https://doi.org/10.22219/JTIUMM.Vol22.No2.224-235Keywords:
Makespan , Transportation Time, Flow Shop, Moth Flame Optimization AlgorithmAbstract
This article examined the flow shop scheduling problem by considering the travel time between machines. The objective function of this problem was to provide a makespan. The Moth Flame Optimization (MFO) algorithm was proposed to solve the flow shop problem. The MFO experiment was carried out with a combination of iteration parameters and the population of the MFO algorithm to solve the flow shop scheduling problem. The computational results showed that MFO could produce a better solution than the actual scheduling method. Furthermore, the MFO Proposal Algorithm was able to reduce the makespan by up to 3%.
Downloads
References
K. R. Baker and D. Trietsch, Principles of sequencing and scheduling. John Wiley & Sons, 2013.
D. M. Utama, L. R. Ardiansyah, and A. K. Garside, "Penjadwalan Flow Shop untuk Meminimasi Total Tardiness Menggunakan Algoritma Cross Entropy–Algoritma Genetika," Jurnal Optimasi Sistem Industri, vol. 18, pp. 133-141, 2019. http://dx.doi.org/10.25077/josi.v18.n2.p133-141.2019.
R. Ginting, "Penjadwalan mesin," Yogyakarta: Graha Ilmu, 2009.
D. M. Utama, "Minimizing Number of Tardy Jobs in Flow Shop Scheduling Using A Hybrid Whale Optimization Algorithm," Journal of Physics: Conference Series, vol. 1845, no. 1, p. 012017, 2021. http://doi.org/10.1088/1742-6596/1845/1/012017.
D. S. Widodo and D. M. Utama, "The Hybrid Ant Lion Optimization Flow Shop Scheduling Problem for Minimizing Completion Time," Journal of Physics: Conference Series, vol. 1569, p. 022097, 2020. http://doi.org/10.1088/1742-6596/1569/2/022097.
D. M. Utama, D. S. Widodo, M. F. Ibrahim, and S. K. Dewi, "An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem," International Journal of Advances in Intelligent Informatics, vol. 6, pp. 23-35, 2020.https://doi.org/10.26555/ijain.v6i1.385.
I. Kuswandi, "Minimasi Maskepan Dengan Penjadwalan Produksi Pada Tipe Produksi Berulang," Jurnal Teknik Industri, vol. 11, no. 1, pp. 84-93, 2010. https://doi.org/10.22219/JTIUMM.Vol11.No1.84-93.
A. Sugioko, "Perbandingan Algoritma Bee Colony dengan Algoritma Bee Colony Tabu List dalam Penjadwalan Flow Shop," Jurnal Metris, vol. 14, no. 2, pp. 113-120, 2013. http://ojs.atmajaya.ac.id/index.php/metris/article/view/19.
D. M. Utama, A. K. Garside, and W. Wicaksono, "Pengembangan Algoritma Hybrid Flowshop Three-Stage Dengan Mempertimbangkan Waktu Setup," Jurnal Ilmiah Teknik Industri, vol. 18, no. 1, pp. 72-78, 2019. https://doi.org/10.23917/jiti.v18i1.7683.
Y. Muharni, E. Febianti, and N. N. Sofa, "Minimasi Makespan Pada Penjadwalan Flow Shop Mesin Paralel Produk Steel Bridge B-60 Menggunakan Metode Longest Processing Time Dan Particle Swarm Optimization," Journal Industrial Servicess, vol. 4, no. 2, pp. 68-75, 2019.doi:http://dx.doi.org/10.36055/jiss.v4i2.5154
M. Hidayat, R. Ekawati, and P. F. Ferdinant, "Minimasi Makespan Penjadwalan Flowshop Menggunakan Metode Algoritma Campbell Dudek Smith (CDS) Dan Metode Algoritma Nawaz Enscore Ham (NEH) Di PT Krakatau Wajatama," Jurnal Teknik Industri Untirta, vol. 4, no. 2, 2017. https://jurnal.untirta.ac.id/index.php/jti/article/viewFile/1405.
D. M. Utama, "Analisa perbandingan penggunaan aturan prioritas penjadwalan pada penjadwalan non delay n job 5 machine," in Prosiding SENTRA (Seminar Teknologi dan Rekayasa), 2016, no. 2, pp. 19-23. http://research-report.umm.ac.id/index.php/sentra/article/view/1826.
D. M. Utama, "Algoritma LPT-Branch and Bound Pada Penjadwalan Flexible Flowshop untuk Meminimasi Makespan," PROZIMA, vol. 2, no. 1, pp. 20-26, 2019. https://doi.org/10.21070/prozima.v2i1.1527
D. S. Widodo, P. B. Santoso, and E. Siswanto, "Pendekatan Algoritma Cross Entropy-Genetic Algorithm Untuk Menurunkan Makespan Pada Penjadwalan Flow Shop," Journal of Engineering Management in Industrial System, vol. 2, no. 1, pp. 41-49, 2014. https://doi.org/10.21776/ub.jemis.2014.002.01.6
H. A. Shiddiq, S. Sugiono, and C. F. M. Tantrika, "Implementasi Algoritma Simulated Annealing Pada Penjadwalan Produksi Untuk Meminimasi Makespan (Studi Kasus di PT. Gatra Mapan, Karang Ploso, Malang)," Jurnal rekayasa dan manajemen sistem industri, vol. 3, no. 1, pp. p43-52, 2015. http://jrmsi.studentjournal.ub.ac.id/index.php/jrmsi/issue/view/17.
H. Wei, S. Li, H. Jiang, J. Hu, and J. Hu, "Hybrid Genetic Simulated Annealing Algorithm for Improved Flow Shop Scheduling with Makespan Criterion," Applied Sciences, vol. 8, no. 12, pp. 2621, 2018. http://doi.org/10.3390/app8122621.
F. Ahmadizar, "A new ant colony algorithm for makespan minimization in permutation flow shops," Computers & Industrial Engineering, vol. 63, no. 2, pp. 355-361, 2012. https://doi.org/10.1016/j.cie.2012.03.015.
J. Grabowski and M. Wodecki, "A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion," Computers & Operations Research, vol. 31, no. 11, pp. 1891-1909, 2004. https://doi.org/10.1016/S0305-0548(03)00145-X.
J. E. C. Arroyo and A. A. de Souza Pereira, "A GRASP heuristic for the multi-objective permutation flowshop scheduling problem," The International Journal of Advanced Manufacturing Technology, vol. 55, no. 5, pp. 741-753, 2011. http://doi.org/10.1007/s00170-010-3100-x.
S. E. Wiratno, N. Rudi, and B. Santosa, "Algoritma Differential Evolution untuk Penjadwalan Flow Shop Banyak Mesin Dengan Multi Obyektif," Jurnal Teknik Industri, vol. 13, no. 1, pp. 1-6, 2012. https://doi.org/10.22219/JTIUMM.Vol13.No1.1-6.
K.-C. Ying, "Minimising makespan for multistage hybrid flowshop scheduling problems with multiprocessor tasks by a hybrid immune algorithm," European Journal of Industrial Engineering, vol. 6, no. 2, pp. 199-215, 2012. https://doi.org/10.1504/EJIE.2012.045605.
R. Ruiz and T. Stützle, "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, vol. 177, pp. 2033-2049, 2007. https://doi.org/10.1016/j.ejor.2005.12.009.
H. F. Rahman, M. N. Janardhanan, L. Poon Chuen, and S. G. Ponnambalam, "Flowshop scheduling with sequence dependent setup times and batch delivery in supply chain," Computers & Industrial Engineering, vol. 158, p. 107378, 2021. https://doi.org/10.1016/j.cie.2021.107378.
J. Hurink and S. Knust, "Makespan minimization for flow-shop problems with transportation times and a single robot," Discrete Applied Mathematics, vol. 112, no. 1, pp. 199-216, 2001. https://doi.org/10.1016/S0166-218X(00)00316-4.
S. Mirjalili, "Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm," Knowledge-Based Systems, vol. 89, pp. 228-249, 2015. https://doi.org/10.1016/j.knosys.2015.07.006.
H. M. Zawbaa, E. Emary, B. Parv, and M. Sharawi, "Feature selection approach based on moth-flame optimization algorithm," in 2016 IEEE Congress on Evolutionary Computation (CEC), 2016, pp. 4612-4617. https://doi.org/10.1109/CEC.2016.7744378.
T. Lamoudan, F. Elkhoukhi, and J. Boukachour, "Flow shop scheduling problem with transportation times, two-robots and inputs/outputs with limited capacity," International Journal of Intelligent Computing Research, vol. 2, no. 1/2/3/, pp. 244-253, 2011.
C.-Y. Lee and V. A. Strusevich, "Two-machine shop scheduling with an uncapacitated interstage transporter," IIE Transactions, vol. 37, no. 8, pp. 725-736, 2005. http://doi.org/10.1080/07408170590918290.
C.-L. Li and J. Ou, "Machine scheduling with pickup and delivery," Naval Research Logistics (NRL), vol. 52, no. 7, pp. 617-630, 2005. https://doi.org/10.1002/nav.20101.
A. Soukhal, A. Oulamara, and P. Martineau, "Complexity of flow shop scheduling problems with transportation constraints," European Journal of Operational Research, vol. 161, pp. 32-41, 2005. https://doi.org/10.1016/j.ejor.2003.03.002.
D. M. Utama and D. S. Widodo, "An energy-efficient flow shop scheduling using hybrid Harris hawks optimization," Bulletin of Electrical Engineering Informatics, vol. 10, no. 3, pp. 1154-1163, 2021. https://doi.org/10.11591/eei.v10i3.2958.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2021 Ikhlasul Amallynda, Bhisma Hutama
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
