Hybrid Cooperative Co-Evolution Algorithm for Deadlock-prone Distributed Assembly Flowshop Scheduling with Limited buffers Using Petri nets
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916581946163200 |
|---|---|
| author | Wang, Siyi Feng, Yanxiang Li, Xiaoling Zhang, Guanghui Yang, Yikang |
| author_facet | Wang, Siyi Feng, Yanxiang Li, Xiaoling Zhang, Guanghui Yang, Yikang |
| contents | The distributed assembly flowshop scheduling problem (DAFSP) can be applied to immense manufacturing environments. In DAFSP, jobs are first processed in distributed flowshops, and then assembled into final products by an assembly machine, which usually has limited buffers in practical application. This limited capacity can lead to deadlocks, halting job completion and blocking the entire manufacturing process. However, existing scheduling methods fail to address these deadlocks in DAFSP effectively. As such, we develop a hybrid cooperative co-evolution (HCCE) algorithm for solving the deadlock-prone DAFSP by minimizing the makespan. For the first time, we use Petri nets to analyze the deadlocks in DAFSP and propose a Petri net-based deadlock amending method (IDAM), which is further integrated into HCCE to ensure the feasibility (i.e., deadlock-freeness) of solutions. Importantly, HCCE contains an elite archive (EAR) and two subpopulations. It uses the problem-specific operators for heuristic initialization and global-search. To enhance the quality and diversity of solutions, an information transfer mechanism (ITM) is developed among subpopulation and EAR, and four local-search operators are performed sequentially on each individual in EAR. Finally, comprehensive experiments demonstrate the effectiveness and superiority of the proposed HCCE algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_14765 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Hybrid Cooperative Co-Evolution Algorithm for Deadlock-prone Distributed Assembly Flowshop Scheduling with Limited buffers Using Petri nets Wang, Siyi Feng, Yanxiang Li, Xiaoling Zhang, Guanghui Yang, Yikang Distributed, Parallel, and Cluster Computing Systems and Control The distributed assembly flowshop scheduling problem (DAFSP) can be applied to immense manufacturing environments. In DAFSP, jobs are first processed in distributed flowshops, and then assembled into final products by an assembly machine, which usually has limited buffers in practical application. This limited capacity can lead to deadlocks, halting job completion and blocking the entire manufacturing process. However, existing scheduling methods fail to address these deadlocks in DAFSP effectively. As such, we develop a hybrid cooperative co-evolution (HCCE) algorithm for solving the deadlock-prone DAFSP by minimizing the makespan. For the first time, we use Petri nets to analyze the deadlocks in DAFSP and propose a Petri net-based deadlock amending method (IDAM), which is further integrated into HCCE to ensure the feasibility (i.e., deadlock-freeness) of solutions. Importantly, HCCE contains an elite archive (EAR) and two subpopulations. It uses the problem-specific operators for heuristic initialization and global-search. To enhance the quality and diversity of solutions, an information transfer mechanism (ITM) is developed among subpopulation and EAR, and four local-search operators are performed sequentially on each individual in EAR. Finally, comprehensive experiments demonstrate the effectiveness and superiority of the proposed HCCE algorithm. |
| title | Hybrid Cooperative Co-Evolution Algorithm for Deadlock-prone Distributed Assembly Flowshop Scheduling with Limited buffers Using Petri nets |
| topic | Distributed, Parallel, and Cluster Computing Systems and Control |
| url | https://arxiv.org/abs/2501.14765 |