基于生成对抗网络的模糊分布式装配流水车间无死锁调度算法
CSTR:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TP273

基金项目:

河北省自然科学基金项目(F2024204007);西安交通大学机械制造系统工程国家重点实验室开放课题项目(sklms2023002).


Generative adversarial networks-based deadlock-free scheduling algorithm for fuzzy distributed assembly flowshops
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    随着全球化和定制化需求的不断发展, 分布式装配流水车间调度问题(DAFSP)受到广泛关注. 为增加现实性, 在DAFSP的基础上进一步考虑了模糊加工时间和有限缓冲区引发的生产死锁约束, 研究一种新的模糊分布式装配流水车间无死锁调度问题. 针对该问题, 首先, 建立以最小化最大模糊完工时间的计算模型; 然后, 基于Petri网提出一种死锁检测和修复算法, 以避免系统死锁状态; 接着, 基于死锁避免算法和生成对抗网络(GANs), 提出一种基于GANs的模糊分布式装配流水车间无死锁调度算法(GAN-DSA), 既能够保证系统活性又能实现高效调度; 最后, 通过32组测试算例实验验证所提出算法的有效性.

    Abstract:

    With the continuous development of globalization and customization demands, the distributed assembly flowshop scheduling problem (DAFSP) has received widespread attention. To add the practicality, this paper further considers the constraints of fuzzy processing time and production deadlock caused by finite assembly buffer in the DAFSP, and therefore a novel fuzzy distributed assembly flowshop deadlock-free scheduling problem (FDAFDSP) is studied. To address this problem, the calculational model is first developed to minimize the maximum fuzzy completion time. Secondly, a Petri nets-based deadlock detection and repair algorithm is proposed to avoid system deadlock. Then, based on deadlock avoidance algorithms and generative adversarial networks (GANs), a GANs-based deadlock-free scheduling algorithm (GAN-DSA) is established for the FDAFDSP, which can avoid deadlocks and achieve efficient scheduling. Finally, the effectiveness of the GAN-DSA for solving the FDAFDSP is experimentally validated by comparing it with related algorithms on 32 test instances.

    参考文献
    相似文献
    引证文献
引用本文

张广辉,赵成龙,魏晨轩,等.基于生成对抗网络的模糊分布式装配流水车间无死锁调度算法[J].控制与决策,2026,41(4):1176-1186

复制
相关视频

分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2025-05-06
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2026-03-24
  • 出版日期: 2026-04-10
文章二维码