{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T12:05:52Z","timestamp":1775822752278,"version":"3.50.1"},"reference-count":20,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T00:00:00Z","timestamp":1684972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This paper presents a new hybrid algorithm that combines genetic algorithms (GAs) and the optimizing spotted hyena algorithm (SHOA) to solve the production shop scheduling problem. The proposed GA-SHOA algorithm incorporates genetic operators, such as uniform crossover and mutation, into the SHOA algorithm to improve its performance. We evaluated the algorithm on a set of OR library instances and compared it to other state-of-the-art optimization algorithms, including SSO, SCE-OBL, CLS-BFO and ACGA. The experimental results show that the GA-SHOA algorithm consistently finds optimal or near-optimal solutions for all tested instances, outperforming the other algorithms. Our paper contributes to the field in several ways. First, we propose a hybrid algorithm that effectively combines the exploration and exploitation capabilities of SHO and GA, resulting in a balanced and efficient search process for finding near-optimal solutions for the FSSP. Second, we tailor the SHO and GA methods to the specific requirements of the FSSP, including encoding schemes, objective function evaluation and constraint handling, which ensures that the hybrid algorithm is well suited to address the challenges posed by the FSSP. Third, we perform a comprehensive performance evaluation of the proposed hybrid algorithm, demonstrating its effectiveness in terms of solution quality and computational efficiency. Finally, we provide an in-depth analysis of the behavior of the hybrid algorithm, discussing the roles of the SHO and GA components and their interactions during the search process, which can help understand the factors contributing to the success of the algorithm and provide insight into potential improvements or adaptations to other combinatorial optimization problems.<\/jats:p>","DOI":"10.3390\/a16060265","type":"journal-article","created":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T02:00:19Z","timestamp":1685066419000},"page":"265","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Hybrid Genetic and Spotted Hyena Optimizer for Flow Shop Scheduling Problem"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5733-3119","authenticated-orcid":false,"given":"Toufik","family":"Mzili","sequence":"first","affiliation":[{"name":"Department of Computer Science, Faculty of Science, Chouaib Doukkali University, EI Jadida 24000, Morocco"}]},{"given":"Ilyass","family":"Mzili","sequence":"additional","affiliation":[{"name":"Department of Management, Faculty of Economics and Management, Hassan First University, Settat 26000, Morocco"}]},{"given":"Mohammed Essaid","family":"Riffi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Science, Chouaib Doukkali University, EI Jadida 24000, Morocco"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6343-5197","authenticated-orcid":false,"given":"Gaurav","family":"Dhiman","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Lebanese American University, Byblos P.O. Box 36, Lebanon"},{"name":"Centre for Research and Development, Department of Computer Science and Engineering, Chandigarh University, Gharuan 140413, India"},{"name":"Department of Computer Science and Engineering, Graphic Era Deemed to be University, Dehradun 248002, India"},{"name":"Division of Research and Development, Lovely Professional University, Punjab 144001, India"},{"name":"Institute of Engineering and Technology, Chitkara University, Punjab 140401, India"},{"name":"Department of Computer Science, Government Bikram College of Commerce, Patiala 147001, India"}]}],"member":"1968","published-online":{"date-parts":[[2023,5,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Grisales-Ram\u00edrez, E., and Osorio, G. (2023). Multi-Objective Combinatorial Optimization Using the Cell Mapping Algorithm for Mobile Robots Trajectory Planning. Electronics, 12.","DOI":"10.3390\/electronics12092105"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Tsai, C.-H., Lin, Y.-D., Yang, C.-H., Wang, C.-K., Chiang, L.-C., and Chiang, P.-J. (2023). A Biogeography-Based Optimization with a Greedy Randomized Adaptive Search Procedure and the 2-Opt Algorithm for the Traveling Salesman Problem. Sustainability, 15.","DOI":"10.3390\/su15065111"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Bhongade, A.S., Khodke, P.M., Rehman, A.U., Nikam, M.D., Patil, P.D., and Suryavanshi, P. (2023). Managing Disruptions in a Flow-Shop Manufacturing System. Mathematics, 11.","DOI":"10.3390\/math11071731"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Cao, L., Chen, H., Chen, Y., Yue, Y., and Zhang, X. (2023). Bio-Inspired Swarm Intelligence Optimization Algorithm-Aided Hybrid TDOA\/AOA-Based Localization. Biomimetics, 8.","DOI":"10.3390\/biomimetics8020186"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","article-title":"Particle swarm optimization","volume":"Volume 4","author":"Kennedy","year":"1995","journal-title":"Proceedings of the ICNN\u201995\u2014International Conference on Neural Networks"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Kulesz, B., Sikora, A., and Zielonka, A. (2019). The Application of Ant Colony Algorithms to Improving the Operation of Traction Rectifier Transformers. Computers, 8.","DOI":"10.3390\/computers8020028"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"102081","DOI":"10.1016\/j.rcim.2020.102081","article-title":"A discrete whale swarm algorithm for hybrid flow-shop scheduling problem with limited buffers","volume":"68","author":"Zhang","year":"2021","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.31181\/dmame0318062022m","article-title":"A novel discrete Rat swarm optimization (DRSO) algorithm for solving the traveling salesman problem","volume":"5","author":"Mzili","year":"2022","journal-title":"Decis. Mak. Appl. Manag. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"5827","DOI":"10.1016\/j.eswa.2010.02.024","article-title":"The circular discrete particle swarm optimization algorithm for flow shop scheduling problem","volume":"37","author":"Zhang","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.knosys.2018.03.011","article-title":"Multi-objective spotted hyena optimizer: A Multi-objective optimization algorithm for engineering problems","volume":"150","author":"Dhiman","year":"2018","journal-title":"Knowl.-Based Syst."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/S0045-7825(99)00392-8","article-title":"Genetic algorithms in computational materials science and engineering: Simulation and design of self-assembling materials","volume":"186","author":"Keser","year":"2000","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.compind.2015.10.001","article-title":"Energy-efficient dynamic scheduling for a flexible flow shop using an improved particle swarm optimization","volume":"81","author":"Tang","year":"2016","journal-title":"Comput. Ind."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"108036","DOI":"10.1016\/j.knosys.2021.108036","article-title":"A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion","volume":"Volume 239","author":"Li","year":"2022","journal-title":"Knowledge-Based Systems"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"108794","DOI":"10.1016\/j.asoc.2022.108794","article-title":"Swarm intelligent based metaheuristics for a bi-objective flexible job shop integrated supply chain scheduling problems","volume":"121","author":"Mahmud","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_15","first-page":"6432","article-title":"The impact of local search strategies on chaotic hybrid firefly particle swarm optimization algorithm in flow-shop scheduling","volume":"34","author":"Kaya","year":"2022","journal-title":"J. King Saud Univ.\u2014Comput. Inf. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"108603","DOI":"10.1016\/j.cie.2022.108603","article-title":"Application of job shop scheduling approach in green patient flow optimization using a hybrid swarm intelligence","volume":"Volume 172","author":"Vali","year":"2022","journal-title":"Computers & Industrial Engineering"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Hayat, I., Tariq, A., Shahzad, W., Masud, M., Ahmed, S., Ali, M.U., and Zafar, A. (2023). Hybridization of Particle Swarm Optimization with Variable Neighborhood Search and Simulated Annealing for Improved Handling of the Permutation Flow-Shop Scheduling Problem. Systems, 11.","DOI":"10.3390\/systems11050221"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Sun, L., Shi, W., Wang, J., Mao, H., Tu, J., and Wang, L. (2023). Research on Production Scheduling Technology in Knitting Workshop Based on Improved Genetic Algorithm. Appl. Sci., 13.","DOI":"10.3390\/app13095701"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"68","DOI":"10.15446\/ing.investig.v38n3.75281","article-title":"Minimising Total Flowtime in a No-Wait Flow Shop (NWFS) using Genetic Algorithms","volume":"38","author":"Chaudhry","year":"2018","journal-title":"Ing. E Investig."},{"key":"ref_20","first-page":"85","article-title":"Application of Social Spider Optimization for Permutation Flow Shop Scheduling Problem","volume":"2","year":"2021","journal-title":"J. Soft Comput. Artif. Intell."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/6\/265\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:42:19Z","timestamp":1760125339000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/6\/265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,25]]},"references-count":20,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["a16060265"],"URL":"https:\/\/doi.org\/10.3390\/a16060265","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,25]]}}}