Optimizing production scheduling with the spotted hyena algorithm: A novel approach to the flow shop problem
DOI:
https://doi.org/10.31181/rme040116072023mKeywords:
Flow shop scheduling, Optimization algorithm, Spotted hyena, Production scheduling, Job sequencing, Resource allocation, Production flow, Flow shop problem, Artificial intelligence, Swarm intelligenceAbstract
The spotted hyena optimization algorithm (SHOA) is a novel approach for solving the flow shop-scheduling problem in manufacturing and production settings. The motivation behind SHOA is to simulate the social dynamics and problem-solving behaviors of spotted hyena packs in order to identify and implement optimal schedules for jobs in a flow shop environment. This approach is unique compared to other optimization algorithms such as WOA, GWO, and BA. Through extensive experimentation, SHOA has been shown to outperform traditional algorithms in terms of solution quality and convergence speed. The purpose of this study is to present the details of the SHOA algorithm, demonstrate its effectiveness, and compare its performance with other optimization approaches. The method used in this study includes extensive experimentation and comparison with other algorithms. The findings of this study show that SHOA is a promising tool for optimizing production processes and increasing efficiency. The implications of this study are that SHOA can be used as an effective tool for solving flow shop-scheduling problems in manufacturing and production settings.
References
Ab Wahab, M. N., Nefti-Meziani, S., & Atyabi, A. (2015). A Comprehensive Review of Swarm Optimization Algorithms. PLOS ONE, 10(5), e0122827. https://doi.org/10.1371/journal.pone.0122827
Akhshabi, M., Tavakkoli-Moghaddam, R., & Rahnamay-Roodposhti, F. (2014). A hybrid particle swarm optimization algorithm for a no-wait flow shop scheduling problem with the total flow time. The International Journal of Advanced Manufacturing Technology, 70(5–8), 1181–1188. https://doi.org/10.1007/s00170-013-5351-9
Almeida, F. S. de, & Nagano, M. S. (2023). Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times. Journal of the Operational Research Society, 74(1), 362–373. https://doi.org/10.1080/01605682.2022.2039569
Anuar, S., Selamat, A., & Sallehuddin, R. (2016). A modified scout bee for artificial bee colony algorithm and its performance on optimization problems. Journal of King Saud University - Computer and Information Sciences, 28(4), 395–406. https://doi.org/10.1016/j.jksuci.2016.03.001
Ball, M. O. (2011). Heuristics based on mathematical programming. Surveys in Operations Research and Management Science, 16(1), 21–38. https://doi.org/10.1016/j.sorms.2010.07.001
Bellabai, J. R., Leela, B. N. M., & Kennedy, S. M. R. (2022). Testing the Performance of Bat-Algorithm for Permutation Flow Shop Scheduling Problems with Makespan Minimization. Brazilian Archives of Biology and Technology, 65. https://doi.org/10.1590/1678-4324-2022210840
Cai, L., Li, W., Luo, Y., & He, L. (2023). Real-time scheduling simulation optimisation of job shop in a production-logistics collaborative environment. International Journal of Production Research, 61(5), 1373–1393. https://doi.org/10.1080/00207543.2021.2023777
Dhiman, G., & Kumar, V. (2018). Multi-objective spotted hyena optimizer: A Multi-objective optimization algorithm for engineering problems. Knowledge-Based Systems, 150, 175–197. https://doi.org/10.1016/j.knosys.2018.03.011
Ghafori, S., & Gharehchopogh, F. S. (2022). Advances in Spotted Hyena Optimizer: A Comprehensive Survey. Archives of Computational Methods in Engineering, 29(3), 1569–1590. https://doi.org/10.1007/s11831-021-09624-4
Jorapur, V., Puranik, V. S., Deshpande, A. S., & Sharma, M. R. (2014). Comparative Study of Different Representations in Genetic Algorithms for Job Shop Scheduling Problem. Journal of Software Engineering and Applications, 07(07), 571–580. https://doi.org/10.4236/jsea.2014.77053
Kennedy, J., & Eberhart, R. (n.d.). Particle swarm optimization. Proceedings of ICNN’95 - International Conference on Neural Networks, 1942–1948. https://doi.org/10.1109/ICNN.1995.488968
Lenat, D. B. (1982). The nature of heuristics. Artificial Intelligence, 19(2), 189–249. https://doi.org/10.1016/0004-3702(82)90036-4
Liao, C.-J., Tjandradjaja, E., & Chung, T.-P. (2012). An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem. Applied Soft Computing, 12(6), 1755–1764. https://doi.org/10.1016/j.asoc.2012.01.011
Li, X., & Yin, M. (2013). A hybrid cuckoo search via Lévy flights for the permutation flow shop scheduling problem. International Journal of Production Research, 51(16), 4732–4754. https://doi.org/10.1080/00207543.2013.767988
Kurdi, M. (2021). Application of Social Spider Optimization for Permutation Flow Shop Scheduling Problem. Journal, 2(2), 85–97. https://dergipark.org.tr/en/pub/jscai/issue/66233/1013405
Musselman, K., O’Reilly, J., & Duket, S. (n.d.). The role of simulation in advanced planning and scheduling. Proceedings of the Winter Simulation Conference, 1825–1830. https://doi.org/10.1109/WSC.2002.1166474
Nagano, M. S., de Almeida, F. S., & Miyata, H. H. (2021). An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering Optimization, 53(8), 1431–1449. https://doi.org/10.1080/0305215X.2020.1797000
Chang, P. C., Chen, S. H., Fan, C. Y., Chan, C. L. (2008). Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems, Applied Mathematics and Computation, 205(2),550-561. https://doi.org/10.1016/j.amc.2008.05.027
Rossit, D. A., Toncovich, A., Rossit, D. G., & Nesmachnow, S. (2021). Solving a flow shop scheduling problem with missing operations in an Industry 4.0 production environment. Journal of Project Management, 33–44. https://doi.org/10.5267/j.jpm.2020.10.001
Shen, L., Dauzère-Pérès, S., & Neufeld, J. S. (2018). Solving the flexible job shop scheduling problem with sequence-dependent setup times. European Journal of Operational Research, 265(2), 503–516. https://doi.org/10.1016/j.ejor.2017.08.021
Yagmahan, B., & Yenisey, M. M. (2008a). Ant colony optimization for multi-objective flow shop scheduling problem. Computers & Industrial Engineering, 54(3), 411–420. https://doi.org/10.1016/j.cie.2007.08.003
Yagmahan, B., & Yenisey, M. M. (2008b). Ant colony optimization for multi-objective flow shop scheduling problem. Computers & Industrial Engineering, 54(3), 411–420. https://doi.org/10.1016/j.cie.2007.08.003
Zhao, F., Zhang, J., Wang, J. and Zhang, C. 2015. A shuffled complex evolution algorithm with opposition-based learning for a permutation flow shop scheduling problem. International Journal of Computer Integrated Manufacturing, 28(11),1220-1235. https://doi.org/10.1080/0951192X.2014.961965
Zhao, F., Liu, Y., Shao, Z., Jiang, X., Zhang, C. and Wang, J. 2016. A chaotic local search based bacterial foraging algorithm and its application to a permutation flow-shop scheduling problem. International Journal of Computer Integrated Manufacturing, 29(9), pp.962-981. https://doi.org/10.1080/0951192X.2015.1130240
