A New Hybrid Social Spider Optimization and Tabu Search for the Permutation Flow Shop Scheduling Problem.
Saved in:
| Title: | A New Hybrid Social Spider Optimization and Tabu Search for the Permutation Flow Shop Scheduling Problem. |
|---|---|
| Authors: | Kurdi, Mohamed1,2 (AUTHOR) mohamed_kurdi@idlib.edu.sy, Mzili, Toufik3 (AUTHOR), Steef, Ahmad1,2 (AUTHOR), Shaheen, Momina4 (AUTHOR), Al-Quraan, Ayman (AUTHOR) aymanqran@yu.edu.jo |
| Source: | Journal of Electrical & Computer Engineering. 3/12/2026, Vol. 2026, p1-14. 14p. |
| Subjects: | Flow shop scheduling, Tabu search algorithm, Combinatorial optimization, Production scheduling, Benchmark problems (Computer science), Metaheuristic algorithms |
| Abstract: | The permutation flow shop scheduling problem (PFSP) is an NP‐complete problem that represents a significant challenge in manufacturing and production environments. Memetic algorithms (MAs) that hybridize global search strategies with local refinement techniques are widely regarded as among the most powerful metaheuristic approaches for addressing complex combinatorial challenges. This paper presents a new hybrid social spider optimization and tabu search (SSO‐TS) approach for minimizing the makespan in PFSP. SSO‐TS combines the strengths of SSO and TS by unifying the global diversification capability of SSO with the local intensification capability of TS, yielding a hybrid strategy that achieves a balance between diversification and intensification. The performance of SSO‐TS is evaluated on the established Taillard benchmark suite. To assess the impact of hybridization, SSO‐TS is first compared with the original SSO algorithm. The results demonstrate that hybridizing SSO with TS significantly improves performance, achieving a 77% reduction in the average percentage error of the best‐obtained solution. SSO‐TS is then evaluated against four leading algorithms from previous research. The experimental results indicate that SSO‐TS outperforms three of the four with respect to solution quality. These findings validate the effectiveness of the proposed approach and establish SSO‐TS as an effective and competitive approach for solving the PFSP. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Electrical & Computer Engineering is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | The permutation flow shop scheduling problem (PFSP) is an NP‐complete problem that represents a significant challenge in manufacturing and production environments. Memetic algorithms (MAs) that hybridize global search strategies with local refinement techniques are widely regarded as among the most powerful metaheuristic approaches for addressing complex combinatorial challenges. This paper presents a new hybrid social spider optimization and tabu search (SSO‐TS) approach for minimizing the makespan in PFSP. SSO‐TS combines the strengths of SSO and TS by unifying the global diversification capability of SSO with the local intensification capability of TS, yielding a hybrid strategy that achieves a balance between diversification and intensification. The performance of SSO‐TS is evaluated on the established Taillard benchmark suite. To assess the impact of hybridization, SSO‐TS is first compared with the original SSO algorithm. The results demonstrate that hybridizing SSO with TS significantly improves performance, achieving a 77% reduction in the average percentage error of the best‐obtained solution. SSO‐TS is then evaluated against four leading algorithms from previous research. The experimental results indicate that SSO‐TS outperforms three of the four with respect to solution quality. These findings validate the effectiveness of the proposed approach and establish SSO‐TS as an effective and competitive approach for solving the PFSP. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 20900147 |
| DOI: | 10.1155/jece/6022369 |
