Energy-efficient No-idle Flowshop Scheduling Optimization Using African Vultures Algorithm
DOI:
https://doi.org/10.24002/ijieem.v6i1.8335Keywords:
african vultures optimization algorithm, energy efficiency, metaheuristic, no-idle flowshop, schedulingAbstract
The issue of energy consumption is currently a major concern globally, especially in the industrial sector, where most of the energy demand comes from the manufacturing sector. To reduce energy consumption, one of the proposed strategies is to reduce the idle time between jobs on machines during the production process, known as No-Idle Permutation Flowshop Scheduling (NIPFSP). This research proposes the application of the African Vultures Optimization Algorithm (AVOA) as a solution to the energy consumption challenge in the case of production scheduling. The algorithm is examined in detail through a series of trials to obtain the most efficient work order in the production schedule, subject to careful setting of iteration and population parameters. The result of implementing the AVOA algorithm is then compared with the method used by the company in a scheduling case. The research findings show that AVOA significantly outperforms the method commonly used by the company, confirming its performance advantage in optimizing energy consumption in the context of production scheduling.
References
Abdollahzadeh, B., Gharehchopogh, F.S., & Mirjalili, S. (2021). African vultures optimization algorithm: a new nature-inspired metaheuristic algorithm for global optimization problems. Computers & Industrial Engineering, 158, Article 107408
Agnetis, A., & Pranzo, M. (2023). Sequencing two classes of jobs on a machine with an external no-idle constraint. International Journal of Production Research, 61(7), 2178–2189
Al-Imron, C.N., Utama, D.M., & Dewi, S.K. (2022). An energy-efficient no idle permutations flow shop scheduling problem using grey wolf optimizer algorithm. Jurnal Ilmiah Teknik Industri, 21(1), 1–10
Balogh, A., Garraffa, M., O’Sullivan, B., & Salassa, F. (2022). MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem. Computers & Operations Research, 146, Article 105862
Biswal, S.R., & Shankar, G. (2022). Optimal deployment and sizing of distributed generations and capacitor banks in radial distribution system using African vultures optimization algorithm. AIP Conference Proceedings, 2681(1), Article 20079
Chen, J., Wang, L., & Peng, Z. (2019). A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling. Swarm and Evolutionary Computation, 50, Article 100557
Cheng, C.-Y., Lin, S.-W., Pourhejazy, P., Ying, K.-C., & Lin, Y.-Z. (2021). No-idle flowshop scheduling for energy-efficient production: an improved optimization framework. Mathematics, 9(12), Article 1335
Della Croce, F., Grosso, A., & Salassa, F. (2021). Minimizing total completion time in the two-machine no-idle no-wait flow shop problem. Journal of Heuristics, 27, 159-173
Ding, J.-Y., Song, S., & Wu, C. (2016). Carbon-efficient scheduling of flow shops by multi-objective optimization. European Journal of Operational Research, 248(3), 758–771
Fahmy, H.M., Sweif, R.A., Hasanien, H.M., Tostado-Véliz, M., Alharbi, M., & Jurado, F. (2023). Parameter identification of lithium-ion battery model based on African vultures optimization algorithm. Mathematics, 11(9), Article 2215
Fang, K., Uhan, N., Zhao, F., & Sutherland, J. W. (2011). A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction. Journal of Manufacturing Systems, 30(4), 234–240
Jovanović, R.Ž., Bugarić, U.S., Vesović, M.V., & Perišić, N.B. (2022). Fuzzy controller optimized by the African vultures algorithm for trajectory tracking of a two-link gripping mechanism. FME Transactions, 50(3), 491–501
Koomey, J. (2011). Growth in data center electricity use 2005 to 2010. A report by Analytical Press, completed at the request of The New York Times, 9(2011), 161
Liu, G.-S., Li, J.-J., & Tang, Y.-S. (2018). Minimizing total idle energy consumption in the permutation flow shop scheduling problem. Asia-Pacific Journal of Operational Research, 35(6), Article 1850041
Mouzon, G., Yildirim, M.B., & Twomey, J. (2007). Operational methods for minimization of energy consumption of manufacturing equipment. International Journal of Production Research, 45(18–19), 4247–4271
Nagano, M.S., Rossi, F.L., & Martarelli, N.J. (2019). High-performing heuristics to minimize flowtime in no-idle permutation flowshop. Engineering Optimization, 51(2), 185–198
Nagano, M.S., Rossi, F.L., & Tomazella, C.P. (2017). A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop. Production Engineering, 11(4), 523–529
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
Öztop, H., Tasgetiren, M. F., Eliiyi, D. T., Pan, Q. K., & Kandiller, L. (2020). An energy-efficient permutation flowshop scheduling problem. Expert systems with applications, 150, Article 113279
Öztop, H., Tasgetiren, M.F., Kandiller, L., & Pan, Q.-K. (2020). A novel general variable neighborhood search through q-learning for no-idle flowshop scheduling. 2020 IEEE Congress on Evolutionary Computation (CEC), 1–8
Öztop, H., Tasgetiren, M.F., Kandiller, L., & Pan, Q.K. (2022). Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion. Computers & Operations Research, 138, Article 105616
Risma, Y. M., & Utama, D. M. (2023). AVOA and ALO Algorithm for Energy-Efficient No-Idle Permutation Flow Shop Scheduling Problem: A Comparison Study. Jurnal Optimasi Sistem Industri, 22(2), 126-141
Rui, Z., & Xingsheng, G.U. (2020). A discrete sine optimization algorithm for no-idle flow-shop scheduling problem. Journal of Shanghai Jiaotong University, 54(12), 1291–1299
Shao, W., Pi, D., & Shao, Z. (2017). Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion. Applied Soft Computing, 54, 164–182
Shen, L., Tasgetiren, M.F., Öztop, H., Kandiller, L., & Gao, L. (2019). A general variable neighborhood search for the no-idle flowshop scheduling problem with makespan criterion. IEEE Symposium Series on Computational Intelligence (SSCI), 1684–1691
Surjandari, I., Rachman, A., Purdianta, D.A., & Dhini, A. (2015). The batch scheduling model for dynamic multiitem, multilevel production in an assembly job-shop with parrallel machines. International Journal of Technology, 1, 84–96
Tampubolon, F.R. (2018). Penggunaan Algoritma Genetika pada Persoalan Multiobjective Flexible Job Shop Scheduling. Doctoral Dissertation, Universitas Sumatera Utara
Tasgetiren, M.F., Pan, Q.-K., Suganthan, P.N., & Oner, A. (2013). A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Applied Mathematical Modelling, 37(10–11), 6758–6779
Utama, D. M. (2018). Pengembangan algoritma neh dan cds untuk meminimasi consumption energy pada penjadwalan flow shop. Prosiding SENTRA (Seminar Teknologi dan Rekayasa), 4, 47–54
Utama, D. M., & Widodo, D. S. (2021). An energy-efficient flow shop scheduling using hybrid Harris hawks optimization. Bulletin of Electrical Engineering and Informatics, 10(3), 1154–1163
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), 62–72
Utama, D.M. (2021). Minimizing Number of Tardy Jobs in Flow Shop Scheduling Using A Hybrid Whale Optimization Algorithm. Journal of Physics: Conference Series, 1845(1), Article 012017
Wu, X., & Che, A. (2019). A memetic differential evolution algorithm for energy-efficient parallel machine scheduling. Omega, 82, 155–165
Yang, X.-S. (2010). Nature-inspired metaheuristic algorithms. Luniver press
Ying, K.-C., Lin, S.-W., Cheng, C.-Y., & He, C.-D. (2017). Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems. Computers & Industrial Engineering, 110, 413–423
Zhao, F., Zhang, L., Cao, J., & Tang, J. (2021). A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem. Computers & Industrial Engineering, 153, Article 107082
Zhao, Z., Zhou, M., & Liu, S. (2021). Iterated greedy algorithms for flow-shop scheduling problems: a tutorial. IEEE Transactions on Automation Science and Engineering, 19(3), 1941–1959
Zhou, Y., Chen, H., & Zhou, G. (2014). Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem. Neurocomputing, 137, 285–292
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 International Journal of Industrial Engineering and Engineering Management
This work is licensed under a Creative Commons Attribution 4.0 International License.
The copyright of the received article shall be assigned to the journal as the publisher of the journal. The intended copyright includes the right to publish the article in various forms (including reprints). The journal maintains the publishing rights to the published articles.
This work is licensed under a Creative Commons Attribution 4.0 International License
