返回
An enhanced walrus optimization algorithm for flexible job shop scheduling with parallel batch processing operation
DOI:10.1038/s41598-025-89527-7.png)
摘要
En 中文
The flexible job shop scheduling problem with parallel batch processing operation (FJSP_PBPO) in this study is motivated by real-world scenarios observed in electronic product testing workshops. This research aims to tackle the deficiency of effective methods, particularly global scheduling metaheuristics, for FJSP_PBPO. We establish an optimization model utilizing mixed-integer programming to minimize makespan and introduce an enhanced walrus optimization algorithm (WaOA) for efficiently solving the FJSP_PBPO. Key innovations of our approach include novel encoding, conversion, inverse conversion, and decoding schemes tailored to the constraints of FJSP_PBPO, a random optimal matching initialization (ROMI) strategy for generating diverse and high-quality initial solutions, as well as modifications to the original feeding, migration, and fleeing strategies of WaOA, along with the introduction of a novel gathering strategy. Our approach significantly improves solution quality and optimization efficiency for FJSP_PBPO, as demonstrated through comparative analysis with four enhanced WaOA variants, eleven state-of-the-art algorithms, and validation across 30 test instances and a real-world engineering case.
Keyword:
Flexible job shop scheduling
Parallel batch processing operations
Walrus optimization algorithm
Makespan
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
27.9W
被引数:
83.5W
机构
引用论文
Red deer algorithm (RDA): a new nature-inspired meta-heuristic马鹿算法 (RDA): 一种新的自然启发的元启发式算法
SOFT COMPUTING
IF2.5
Integrated optimization of production scheduling and maintenance planning with dynamic job arrivals and mold constraints具有动态作业到达和模具约束的生产计划和维护计划的集成优化

