A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems
Abstract Flow shop scheduling has garnered significant attention from researchers over the past ten years, establishing itself as a prominent area of study within the field of scheduling. Nevertheless, there exists a paucity of research dedicated to addressing Non-Permutation Flow Shop Scheduling Pr...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-04-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-025-88124-y |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849726554971570176 |
|---|---|
| author | Bilal Khurshid Shahid Maqsood Muhammad Salman Habib Muhammad Omair Seung-June Hwang |
| author_facet | Bilal Khurshid Shahid Maqsood Muhammad Salman Habib Muhammad Omair Seung-June Hwang |
| author_sort | Bilal Khurshid |
| collection | DOAJ |
| description | Abstract Flow shop scheduling has garnered significant attention from researchers over the past ten years, establishing itself as a prominent area of study within the field of scheduling. Nevertheless, there exists a paucity of research dedicated to addressing Non-Permutation Flow Shop Scheduling Problems. In this study, a Hybrid Evolution Strategies (HES) is suggested by combining the exploitation ability of Nawaz, Enscore, and Ham (NEH) Heuristic, the exploration ability of Improved Evolution Strategies (IES), and a Local Search Technique to minimize the makespan of NPFSSP. The primary solution is produced through the NEH Heuristic, serving as a foundational solution for the IES. The IES is applied in two stages, in the first stage it improves the permutation sequence found from the NEH heuristic. In the second stage of the IES, the permutation sequence on the first 40% of machines is fixed as found in the first stage. The sequence on the last 60% of machines is altered only so that the makespan is minimized and a good non-permutation sequence is found. Recombination and mutation are the main genetic operators in IES. For recombination in IES, 16 offspring are generated randomly from a single parent. The Quad swap mutation operator is employed in the IES to optimize the utilization of the solution space while minimizing computational time. To prevent trapping in local minima, a Local Search Technique is integrated into the IES algorithm, which guides solutions to less explored areas. Computational analyses indicate that HES exhibits superior performance regarding solution quality, computational efficiency, and robustness. |
| format | Article |
| id | doaj-art-7ab2c2bdc5514315b197d76dcc3306dd |
| institution | DOAJ |
| issn | 2045-2322 |
| language | English |
| publishDate | 2025-04-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | Scientific Reports |
| spelling | doaj-art-7ab2c2bdc5514315b197d76dcc3306dd2025-08-20T03:10:09ZengNature PortfolioScientific Reports2045-23222025-04-0115112110.1038/s41598-025-88124-yA hybrid evolution strategies algorithm for non-permutation flow shop scheduling problemsBilal Khurshid0Shahid Maqsood1Muhammad Salman Habib2Muhammad Omair3Seung-June Hwang4Department of Industrial Engineering, University of Engineering and TechnologyDepartment of Industrial Engineering, Jalozai Campus, University of Engineering and TechnologyInstitute of Knowledge Services, Center for Creative Convergence Education, Hanyang University ERICA CampusDepartment of Industrial Engineering, Jalozai Campus, University of Engineering and TechnologyCollege of Business and Economics, Hanyang University ERICA CampusAbstract Flow shop scheduling has garnered significant attention from researchers over the past ten years, establishing itself as a prominent area of study within the field of scheduling. Nevertheless, there exists a paucity of research dedicated to addressing Non-Permutation Flow Shop Scheduling Problems. In this study, a Hybrid Evolution Strategies (HES) is suggested by combining the exploitation ability of Nawaz, Enscore, and Ham (NEH) Heuristic, the exploration ability of Improved Evolution Strategies (IES), and a Local Search Technique to minimize the makespan of NPFSSP. The primary solution is produced through the NEH Heuristic, serving as a foundational solution for the IES. The IES is applied in two stages, in the first stage it improves the permutation sequence found from the NEH heuristic. In the second stage of the IES, the permutation sequence on the first 40% of machines is fixed as found in the first stage. The sequence on the last 60% of machines is altered only so that the makespan is minimized and a good non-permutation sequence is found. Recombination and mutation are the main genetic operators in IES. For recombination in IES, 16 offspring are generated randomly from a single parent. The Quad swap mutation operator is employed in the IES to optimize the utilization of the solution space while minimizing computational time. To prevent trapping in local minima, a Local Search Technique is integrated into the IES algorithm, which guides solutions to less explored areas. Computational analyses indicate that HES exhibits superior performance regarding solution quality, computational efficiency, and robustness.https://doi.org/10.1038/s41598-025-88124-yNon-permutation flow shop scheduling problemsHybrid evolution strategiesLocal search techniqueMakespan |
| spellingShingle | Bilal Khurshid Shahid Maqsood Muhammad Salman Habib Muhammad Omair Seung-June Hwang A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems Scientific Reports Non-permutation flow shop scheduling problems Hybrid evolution strategies Local search technique Makespan |
| title | A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems |
| title_full | A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems |
| title_fullStr | A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems |
| title_full_unstemmed | A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems |
| title_short | A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems |
| title_sort | hybrid evolution strategies algorithm for non permutation flow shop scheduling problems |
| topic | Non-permutation flow shop scheduling problems Hybrid evolution strategies Local search technique Makespan |
| url | https://doi.org/10.1038/s41598-025-88124-y |
| work_keys_str_mv | AT bilalkhurshid ahybridevolutionstrategiesalgorithmfornonpermutationflowshopschedulingproblems AT shahidmaqsood ahybridevolutionstrategiesalgorithmfornonpermutationflowshopschedulingproblems AT muhammadsalmanhabib ahybridevolutionstrategiesalgorithmfornonpermutationflowshopschedulingproblems AT muhammadomair ahybridevolutionstrategiesalgorithmfornonpermutationflowshopschedulingproblems AT seungjunehwang ahybridevolutionstrategiesalgorithmfornonpermutationflowshopschedulingproblems AT bilalkhurshid hybridevolutionstrategiesalgorithmfornonpermutationflowshopschedulingproblems AT shahidmaqsood hybridevolutionstrategiesalgorithmfornonpermutationflowshopschedulingproblems AT muhammadsalmanhabib hybridevolutionstrategiesalgorithmfornonpermutationflowshopschedulingproblems AT muhammadomair hybridevolutionstrategiesalgorithmfornonpermutationflowshopschedulingproblems AT seungjunehwang hybridevolutionstrategiesalgorithmfornonpermutationflowshopschedulingproblems |