AVOA and ALO Algorithm for Energy-Efficient No-Idle Permutation Flow Shop Scheduling Problem: A Comparison Study
Main Article Content
Keywords
African Vultures Optimization, No-Idle Permutation Flow Shop, Energy Efficient
Abstract
Global energy consumption is a pressing issue and is predicted to continue increasing between 2010 and 2040. Among the various sectors, the industrial sector, particularly manufacturing, is the main driver of this increase. To effectively address this growing problem and support energy conservation efforts, reducing idle time on production-related machines is critical. The No-Idle Permutation Flow Shop Problem (NIPFSP) and, indirectly, the need to reduce energy consumption in manufacturing processes are the driving forces behind this study. The African Vultures Optimization Algorithm (AVOA) and the Ant Lion Optimizer (ALO) are two novel meta-heuristic algorithms designed to achieve this goal. The effectiveness of both AVOA and ALO was rigorously evaluated across three distinct scenarios: small, medium, and large. Statistical analysis, in the form of independent sample t-tests, was employed to compare the performance of these algorithms. We found that, while both algorithms yielded similar results in the small case, AVOA demonstrated a superior capability in optimizing the NIPFSP in the medium and large cases and, consequently, in curbing energy consumption. This implies that AVOA offers a more promising approach to addressing energy consumption concerns in the manufacturing sector, particularly in scenarios involving medium- to large-scale production processes. The implementation of such innovative meta-heuristic algorithms holds the potential to significantly contribute to global energy conservation efforts while enhancing the efficiency of industrial operations.
Downloads
References
[2] K. Fang, N. Uhan, F. Zhao, and J. W. Sutherland, “A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction,” J. Manuf. Syst., vol. 30, no. 4, pp. 234–240, 2011.
[3] Y. Zhao et al., “A comparative study of energy consumption and efficiency of Japanese and Chinese manufacturing industry,” Energy Policy, vol. 70, pp. 45–56, 2014.
[4] J. Walther and M. Weigold, “A systematic review on predicting and forecasting the electrical energy consumption in the manufacturing industry,” Energies, vol. 14, no. 4, p. 968, 2021.
[5] C. Clauser and M. Ewert, “The renewables cost challenge: Levelized cost of geothermal electric energy compared to other sources of primary energy–Review and case study,” Renew. Sustain. Energy Rev., vol. 82, pp. 3683–3693, 2018.
[6] G. Mouzon, M. B. Yildirim, and J. Twomey, “Operational methods for minimization of energy consumption of manufacturing equipment,” Int. J. Prod. Res., vol. 45, no. 18–19, pp. 4247–4271, 2007.
[7] I. Surjandari, A. Rachman, D. A. Purdianta, and A. Dhini, “The Batch Sheduling Model for Dynamic multiitem, Multilevel Production in an assembly Job-Shop with Parrallel Machines.,” Int. J. Technol., vol. 1, pp. 84–96, 2015.
[8] K. Thawongklang and L. Tanwanichkul, “Application of production scheduling techniques for dispatching ready-mixed concrete,” Int. J. Technol., vol. 7, no. 7, pp. 1163–1170, 2016.
[9] M. F. Tasgetiren, Q.-K. Pan, P. N. Suganthan, and T. Jin Chua, “A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion,” Int. J. Prod. Res., vol. 49, no. 16, pp. 5033–5050, 2011.
[10] K.-C. Ying, S.-W. Lin, C.-Y. Cheng, and C.-D. He, “Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems,” Comput. Ind. Eng., vol. 110, pp. 413–423, 2017.
[11] Y. Zhou, H. Chen, and G. Zhou, “Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem,” Neurocomputing, vol. 137, pp. 285–292, 2014.
[12] F. Zhao, L. Zhang, J. Cao, and J. Tang, “A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem,” Comput. Ind. Eng., vol. 153, p. 107082, 2021.
[13] W. Shao, D. Pi, and Z. Shao, “Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion,” Appl. Soft Comput., vol. 54, pp. 164–182, 2017.
[14] H. Öztop, M. F. Tasgetiren, D. T. Eliiyi, Q.-K. Pan, and L. Kandiller, “An energy-efficient permutation flowshop scheduling problem,” Expert Syst. Appl., vol. 150, p. 113279, 2020.
[15] M. F. Tasgetiren, Q.-K. Pan, P. N. Suganthan, and A. Oner, “A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion,” Appl. Math. Model., vol. 37, no. 10–11, pp. 6758–6779, 2013.
[16] M. S. Nagano, F. L. Rossi, and C. P. Tomazella, “A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop,” Prod. Eng., vol. 11, no. 4, pp. 523–529, 2017.
[17] C. N. Al-Imron, D. M. Utama, and S. K. Dewi, “An Energy-Efficient No Idle Permutations Flow Shop Scheduling Problem Using Grey Wolf Optimizer Algorithm,” J. Ilm. Tek. Ind., vol. 21, no. 1, pp. 1–10, 2022.
[18] B. Abdollahzadeh, F. S. Gharehchopogh, and S. Mirjalili, “African vultures optimization algorithm: A new nature-inspired metaheuristic algorithm for global optimization problems,” Comput. Ind. Eng., vol. 158, p. 107408, 2021.
[19] S. Mirjalili, “The ant lion optimizer,” Adv. Eng. Softw., vol. 83, pp. 80–98, 2015.
[20] C. Kumar and D. M. Mary, “Parameter estimation of three-diode solar photovoltaic model using an Improved-African Vultures optimization algorithm with Newton–Raphson method,” J. Comput. Electron., vol. 20, no. 6, pp. 2563–2593, 2021.
[21] J. Zhang, M. Khayatnezhad, and N. Ghadimi, “Optimal model evaluation of the proton-exchange membrane fuel cells based on deep learning and modified African Vulture Optimization Algorithm,” Energy Sources, Part A Recover. Util. Environ. Eff., vol. 44, no. 1, pp. 287–305, 2022.
[22] H. A. Bagal, Y. N. Soltanabad, M. Dadjuo, K. Wakil, M. Zare, and A. S. Mohammed, “SOFC model parameter identification by means of Modified African Vulture Optimization algorithm,” Energy Reports, vol. 7, pp. 7251–7260, 2021.
[23] R. Ž. Jovanović, U. S. Bugarić, M. V Vesović, and N. B. Perišić, “Fuzzy controller optimized by the African vultures algorithm for trajectory tracking of a two-link gripping mechanism,” FME Trans., vol. 50, no. 3, pp. 491–501, 2022.
[24] D. Gürses, P. Mehta, S. M. Sait, and A. R. Yildiz, “African vultures optimization algorithm for optimization of shell and tube heat exchangers,” Mater. Test., vol. 64, no. 8, pp. 1234–1241, 2022.
[25] G. Vashishtha, S. Chauhan, A. Kumar, and R. Kumar, “An ameliorated African vulture optimization algorithm to diagnose the rolling bearing defects,” Meas. Sci. Technol., vol. 33, no. 7, p. 75013, 2022.
[26] L. Chen, H. Huang, P. Tang, D. Yao, H. Yang, and N. Ghadimi, “Optimal modeling of combined cooling, heating, and power systems using developed African Vulture Optimization: a case study in watersport complex,” Energy Sources, Part A Recover. Util. Environ. Eff., vol. 44, no. 2, pp. 4296–4317, 2022.
[27] M. Wang, X. Zhao, A. A. Heidari, and H. Chen, “Evaluation of constraint in photovoltaic models by exploiting an enhanced ant lion optimizer,” Sol. Energy, vol. 211, pp. 503–521, 2020.
[28] P. Yao and H. Wang, “Dynamic Adaptive Ant Lion Optimizer applied to route planning for unmanned aerial vehicle,” Soft Comput., vol. 21, no. 18, pp. 5475–5488, 2017.
[29] K. Roy, K. K. Mandal, and A. C. Mandal, “Ant-Lion Optimizer algorithm and recurrent neural network for energy management of micro grid connected system,” Energy, vol. 167, pp. 402–416, 2019.
[30] J. Wang, P. Du, H. Lu, W. Yang, and T. Niu, “An improved grey model optimized by multi-objective ant lion optimization algorithm for annual electricity consumption forecasting,” Appl. Soft Comput., vol. 72, pp. 321–337, 2018.
[31] D. M. Utama, T. Baroto, D. M. Maharani, F. R. Jannah, and R. A. Octaria, “Algoritma ant-lion optimizer untuk meminimasi emisi karbon pada penjadwalan flow shop dependent sequence set-up,” J. Litbang Ind., vol. 9, no. 1, pp. 69–78, 2018.
[32] D. M. Utama and D. S. Widodo, “An energy-efficient flow shop scheduling using hybrid Harris hawks optimization,” Bull. Electr. Eng. Informatics; Vol 10, No 3 June 2021DO - 10.11591/eei.v10i3.2958 , Jun. 2021, [Online]. Available: https://beei.org/index.php/EEI/article/view/2958
[33] D. M. Utama, “Minimizing Number of Tardy Jobs in Flow Shop Scheduling Using A Hybrid Whale Optimization Algorithm,” in Journal of Physics Conference Series, Mar. 2021, vol. 1845, p. 12017. doi: 10.1088/1742-6596/1845/1/012017.
[34] X.-S. Yang, Nature-inspired metaheuristic algorithms. Luniver press, 2010.
[35] E. Umamaheswari, S. Ganesan, M. Abirami, and S. Subramanian, “Cost effective integrated maintenance scheduling in power systems using ant lion optimizer,” Energy Procedia, vol. 117, pp. 501–508, 2017.
[36] J. Carlier, “Ordonnancements a contraintes disjonctives,” RAIRO-Operations Res., vol. 12, no. 4, pp. 333–350, 1978.
[37] C. R. Reeves, “A genetic algorithm for flowshop sequencing,” Comput. Oper. Res., vol. 22, no. 1, pp. 5–13, 1995.
Article Sidebar
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Authors' Retention of Copyright
Authors retain the copyright of their original work published in Jurnal Optimasi Sistem Industri (JOSI). By submitting their manuscript to the journal, authors grant Jurnal Optimasi Sistem Industri (JOSI) a non-exclusive license to publish the work under the CC BY-NC-SA 4.0 International License. This means that others are permitted to:
- Share and adapt the work for non-commercial purposes, provided proper attribution is given to the original authors and source.
- Create derivative works based on the original article, as long as the new work is non-commercial and under the same CC BY-NC-SA 4.0 International License.
Non-Commercial Usage
The CC BY-NC-SA 4.0 International License restricts commercial use of the published work and its derivatives. Commercial use includes generating revenue, financial gain, or any form of commercial exploitation. This limitation aims to preserve the scholarly and educational nature of the content.
ShareAlike Requirement
If you remix, adapt, or build upon the work, you must distribute your contributions under the same CC BY-NC-SA 4.0 International License as the original work. This "ShareAlike" requirement ensures that any new works based on the original content adhere to the same non-commercial, share-alike principles.
Usage, Attribution, and Citations
Authors and readers are allowed to:
- Share and distribute the published article in any medium or format.
- Adapt, remix, transform, and build upon the article for non-commercial purposes.
- Provide appropriate attribution to the original authors and the journal.
When using content from Jurnal Optimasi Sistem Industri (JOSI), proper attribution must be provided through citation of the original source and authors.
Copyright Infringement and Ethical Considerations
If you believe that any material published in Jurnal Optimasi Sistem Industri (JOSI) infringes upon your copyright or the copyright of someone you represent, please contact the editorial team promptly. The journal is committed to addressing copyright concerns in accordance with established ethical guidelines set forth by the Committee on Publication Ethics (COPE).
For any questions or inquiries related to copyright and licensing, please contact the editorial team at editor_josi[at]eng.unand.ac.id.
