arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.14765cs.DCcs.SYeess.SY
收藏

混合协同进化算法用于基于Petri网的有限缓冲区易死锁分布式装配流水车间调度

Hybrid Cooperative Co-Evolution Algorithm for Deadlock-prone Distributed Assembly Flowshop Scheduling with Limited buffers Using Petri nets

Siyi Wang, Yanxiang Feng, Xiaoling Li, Guanghui Zhang, Yikang Yang

AI总结:

针对有限缓冲区分布式装配流水车间调度中的死锁问题,提出混合协同进化算法,首次用Petri网分析并修正死锁,集成精英档案与信息传递机制,实验验证其有效性。

摘要:

分布式装配流水车间调度问题(DAFSP)可应用于大规模制造环境。在DAFSP中,作业首先在分布式流水车间中加工,然后由装配机器组装成最终产品,在实际应用中该装配机器通常具有有限缓冲区。这种有限容量可能导致死锁,从而中止作业完成并阻塞整个制造过程。然而,现有调度方法未能有效解决DAFSP中的这些死锁问题。为此,我们开发了一种混合协同进化(HCCE)算法,通过最小化完工时间来解决易死锁的DAFSP。我们首次使用Petri网分析DAFSP中的死锁,并提出了一种基于Petri网的死锁修正方法(IDAM),该方法进一步集成到HCCE中以确保解的可行性(即无死锁性)。重要的是,HCCE包含一个精英档案(EAR)和两个子种群。它使用问题特定算子进行启发式初始化和全局搜索。为了增强解的质量和多样性,在子种群和EAR之间开发了一种信息传递机制(ITM),并对EAR中的每个个体依次执行四种局部搜索算子。最后,综合实验证明了所提出的HCCE算法的有效性和优越性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑