An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem 
^{(2) } Dian Setiya Widodo (University of 17 Agustus 1945 Surabaya, Indonesia)
^{(3) } Muhammad Faisal Ibrahim (Universitas Internasional Semen Indonesia, Indonesia)
^{(4) } Shanty Kusuma Dewi (Departement of Industrial Engineering, University Of Muhammadiyah Malang (UMM), Indonesia)
^{*}corresponding author
AbstractThis article aimed to develop an improved Ant Lion algorithm. The objective function was to minimize the mean tardiness on the flow shop scheduling problem with a focus on the permutation flow shop problem (PFSP). The Hybrid Ant Lion Optimization Algorithm (HALO) with local strategy was proposed, and from the total search of the agent, the NEHEDD algorithm was applied. Moreover, the diversity of the nominee schedule was improved through the use of swap mutation, flip, and slide to determine the best solution in each iteration. Finally, the HALO was compared with some algorithms, while some numerical experiments were used to show the performances of the proposed algorithms. It is important to note that comparative analysis has been previously conducted using the nine variations of the PFSSP problem, and the HALO obtained was compared to other algorithms based on numerical experiments.
KeywordsOptimization; Mean tardiness; Hybrid ant lion; Flow shop; Scheduling

DOIhttps://doi.org/10.26555/ijain.v6i1.385 
Article metricsAbstract views : 653  PDF views : 141 
Cite 
Full TextDownload 
References
[1] D. M. Utama, T. Baroto, D. Maharani, F. R. Jannah, and R. A. Octaria, "Algoritma AntLion optimizer untuk meminimasi emisi karbon pada penjadwalan flow shop dependent sequence setup," 2019, vol. 9, pp. 6978, 20190628 2019, doi: 10.24960/jli.v9i1.4775.6978.
[2] M. S. Nagano, R. Ruiz, and L. A. N. Lorena, "A Constructive Genetic Algorithm for permutation flowshop scheduling," Computers & Industrial Engineering, vol. 55, pp. 195207, 2008, doi: 10.1016/j.cie.2007.11.018.
[3] H. F. Rahman, R. Sarker, and D. Essam, "A genetic algorithm for permutation flow shop scheduling under make to stock production system," Computers & Industrial Engineering, vol. 90, pp. 1224, 2015, doi: 10.1016/j.cie.2015.08.006.
[4] Q. C. Ta, J.C. Billaut, and J.L. Bouquard, "Matheuristic algorithms for minimizing total tardiness in the mmachine flowshop scheduling problem," Journal of Intelligent Manufacturing, vol. 29, pp. 617628, 2018, doi: 10.1007/s1084501510464.
[5] 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. 133141, 2019, doi: 10.25077/josi.v18.n2.p133141.2019.
[6] K. Karabulut, "A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops," Computers & Industrial Engineering, vol. 98, pp. 300307, 2016, doi: 10.1016/j.cie.2016.06.012.
[7] D. M. Utama, D. S. Widodo, W. Wicaksono, and L. R. Ardiansyah, "A New Hybrid Metaheuristics Algorithm for Minimizing Energy Consumption in the Flow Shop Scheduling Problem," International Journal of Technology, vol. 10, pp. 320331, 2019, doi: 10.14716/ijtech.v10i2.2194.
[8] Y.D. Kim, "Heuristics for flowshop scheduling problems minimizing mean tardiness," Journal of the Operational Research Society, vol. 44, pp. 1928, 1993, doi: 10.1057/jors.1993.3.
[9] V. FernandezViagas and J. M. Framinan, "NEHbased heuristics for the permutation flowshop scheduling problem to minimise total tardiness," Computers & Operations Research, vol. 60, pp. 2736, 2015, doi: 10.1016/j.cor.2015.02.002.
[10] M. Nawaz, E. E. Enscore, and I. Ham, "A heuristic algorithm for the mmachine, njob flowshop sequencing problem," Omega, vol. 11, pp. 9195, 1983, doi: 10.1016/03050483(83)900889.
[11] M. S. Nagano, F. L. Rossi, and C. P. Tomazella, "A new efficient heuristic method for minimizing the total tardiness in a noidle permutation flow shop," Production Engineering, vol. 11, pp. 523529, 2017, doi: 10.1007/s1174001707472.
[12] V. FernandezViagas and J. M. Framinan, "Efficient nonpopulationbased algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness," Computers & Operations Research, vol. 64, pp. 8696, 2015, doi: 10.1016/j.cor.2015.05.006.
[13] R. M’Hallah, "An iterated local search variable neighborhood descent hybrid heuristic for the total earliness tardiness permutation flow shop," International Journal of Production Research, vol. 52, pp. 38023819, 2014/07/03 2014, doi: 10.1080/00207543.2014.899719.
[14] J.M. Kim, Y.D. Zhou, and D.H. Lee, "Priority scheduling to minimize the total tardiness for remanufacturing systems with flowshoptype reprocessing lines," The International Journal of Advanced Manufacturing Technology, vol. 91, pp. 36973708, 2017, doi: 10.1007/s001700170057z.
[15] M. AbdelBasset, G. Manogaran, D. ElShahat, and S. Mirjalili, "A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem," Future Generation Computer Systems, vol. 85, pp. 129145, 2018, doi: 10.1016/j.future.2018.03.020.
[16] E. Vallada and R. Ruiz, "Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem," Omega, vol. 38, pp. 5767, 2010, doi: 10.1016/j.omega.2009.04.002.
[17] V. c. A. Armentano and D. P. Ronconi, "Tabu search for total tardiness minimization in flowshop scheduling problems," Computers & Operations Research, vol. 26, pp. 219235, 1999, doi: 10.1016/S03050548(98)000604.
[18] H. Mokhtari and A. Noroozi, "An efficient chaotic based PSO for earliness/tardiness optimization in a batch processing flow shop scheduling problem," Journal of Intelligent Manufacturing, vol. 29, pp. 10631081, 2018, doi: 10.1007/s108450151158x.
[19] S. Hasija and C. Rajendran, "Scheduling in flowshops to minimize total tardiness of jobs," International Journal of Production Research, vol. 42, pp. 22892301, 2004, doi: 10.1080/00207540310001657595.
[20] W. Shao, D. Pi, and Z. Shao, "A hybrid discrete teachinglearning based metaheuristic for solving noidle flow shop scheduling problem with total tardiness criterion," Computers & Operations Research, vol. 94, pp. 89105, 2018, doi: 10.1016/j.cor.2018.02.003.
[21] W. Liao and Y. Fu, "A New Robust Scheduling Model for Permutation Flow Shop Problem," Recent Advances in Intelligent Manufacturing, pp. 308317, 2018, doi: 10.1007/9789811323966_29.
[22] R. Nasution, A. K. Garside, and D. M. Utama, "Penjadwalan Job Shop Dengan Pendekatan Algoritma Artificial Immune System," 2017, vol. 18, p. 14, 2017, doi: 10.22219/JTIUMM.Vol18.No1.2942.
[23] J.n. Shen, L. Wang, and S.y. Wang, "A bipopulation EDA for solving the noidle permutation flowshop scheduling problem with the total tardiness criterion," KnowledgeBased Systems, vol. 74, pp. 167175, 2015, doi: 10.1016/j.knosys.2014.11.016.
[24] J. Haddock and J. Mittenthal, "Simulation Optimization Using Simulated Annealing," Computers & Industrial Engineering, vol. 22, pp. 387395, 1992, doi: 10.1016/03608352(92)90014B.
[25] D. M. Utama, "An Effective Hybrid Sine Cosine Algorithm to Minimize Carbon Emission on Flowshop Scheduling Sequence Dependent Setup," 2019, vol. 20, pp. 6272, 2019, doi: 10.22219/JTIUMM.Vol20.No1.6272.
[26] S. Mirjalili, "The Ant Lion Optimizer," Advances in Engineering Software, vol. 83, pp. 8098, 2015, doi: 10.1016/j.advengsoft.2015.01.010.
[27] N. Chopra and S. Mehta, "Multiobjective optimum generation scheduling using Ant Lion Optimization," in 2015 Annual IEEE India Conference (INDICON), 2015, pp. 16, doi: 10.1109/INDICON.2015.7443839.
[28] H. M. Dubey, M. Pandit, and B. K. Panigrahi, "Hydrothermalwind scheduling employing novel Ant Lion optimization technique with composite ranking index," Renewable Energy, vol. 99, pp. 1834, 2016, doi: 10.1016/j.renene.2016.06.039.
[29] E. Umamaheswari, S. Ganesan, M. Abirami, and S. Subramanian, "Deterministic reliability model based preventive generator maintenance scheduling using Ant Lion Optimizer," in 2016 International Conference on Circuit, Power and Computing Technologies (ICCPCT), 2016, pp. 18, doi: 10.1109/ICCPCT.2016.7530272.
[30] M. Petrović, J. Petronijević, M. Mitić, N. Vuković, Z. Miljković, and B. Babić, "The Ant Lion optimization algorithm for integrated process planning and scheduling," in Applied Mechanics and Materials, 2016, pp. 187192, doi: 10.4028/www.scientific.net/AMM.834.187.
[31] X. Li and M. Yin, "An oppositionbased differential evolution algorithm for permutation flow shop scheduling based on diversity measure," Advances in Engineering Software, vol. 55, pp. 1031, 2013, doi: 10.1016/j.advengsoft.2012.09.003.
[32] P. Hansen and N. Mladenović, "Variable neighborhood search: Principles and applications," European Journal of Operational Research, vol. 130, pp. 449467, 2001, doi: 10.1016/S03772217(00)001004.
[33] G. Laporte, M. Gendreau, J. Y. Potvin, and F. Semet, "Classical and modern heuristics for the vehicle routing problem," International transactions in operational research, vol. 7, pp. 285300, 2000, doi: 10.1111/j.14753995.2000.tb00200.x.
[34] S. Parthasarathy and C. Rajendran, "A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequencedependent setup times of jobsa case study," Production Planning & Control, vol. 8, pp. 475483, 1997, doi: 10.1080/095372897235055.
[35] M. R. Garey, D. S. Johnson, and R. Sethi, "The complexity of flowshop and jobshop scheduling," Mathematics of operations research, vol. 1, pp. 117129, 1976, doi: 10.1287/moor.1.2.117.
This work is licensed under a Creative Commons AttributionShareAlike 4.0 International License.
___________________________________________________________
International Journal of Advances in Intelligent Informatics
ISSN 24426571 (print)  25483161 (online)
Organized by Informatics Department  Universitas Ahmad Dahlan, UTM Big Data Centre  Universiti Teknologi Malaysia, and ASCEE Computer Society
Published by Universitas Ahmad Dahlan
W: http://ijain.org
E: ijain@uad.ac.id (paper handling issues)
info@ijain.org, andri.pranolo.id@ieee.org (publication issues)
This work is licensed under a Creative Commons AttributionShareAlike 4.0