An Iterated Greedy Algorithm With Reinforcement Learning for Distributed Hybrid Flowshop Problems With Job Merging

The distributed hybrid flowshop scheduling problems (DHFSPs) widely exist in various industrial production processes, and thus have received widespread attention. However, the existing research mainly focuses on interfactory and intermachine collaboration, but ignores collaborative processing betwee...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on evolutionary computation Ročník 29; číslo 3; s. 589 - 600
Hlavní autoři: Tao, Xin-Rui, Pan, Quan-Ke, Gao, Liang
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.06.2025
Témata:
Collaboration
Distributed hybrid flowshop
Greedy algorithms
Heuristic algorithms
iterated greedy algorithm
job merging
Merging
Optimization
Prediction algorithms
Production facilities
reinforcement learning (RL)
rescheduling
ISSN:1089-778X, 1941-0026
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The distributed hybrid flowshop scheduling problems (DHFSPs) widely exist in various industrial production processes, and thus have received widespread attention. However, the existing research mainly focuses on interfactory and intermachine collaboration, but ignores collaborative processing between jobs. Therefore, this article considers rescheduling DHFSP with job merging and reworking (DHFRPJM) and establishes a mixed-integer linear programming model. The objective is to minimize the makespan. Based on problem-specific knowledge, a decoding heuristic and initialization strategy considering job merging are designed. An acceleration strategy based on critical path is adopted to save the computational effort of the iterated greedy algorithm. A local search strategy based on a deep reinforcement learning algorithm further improves the performance of the algorithm. Experimental results based on actual production data show that the proposed algorithm outperforms other algorithms in closely related literature.
ISSN:1089-778X
1941-0026
DOI:10.1109/TEVC.2024.3443874