Dynamic scheduling for flexible job shop with insufficient transportation resources via graph neural network and deep reinforcement learning

被引:36
作者
Zhang, Min [1 ]
Wang, Liang [1 ]
Qiu, Fusheng [1 ]
Liu, Xiaorui [1 ]
机构
[1] Tongji Univ, Sch Mech Engn, Shanghai, Peoples R China
关键词
Flexible job shop scheduling; Insufficient transportation resources; Dynamic scheduling; Graph neural network; Deep reinforcement learning; ALGORITHMS;
D O I
10.1016/j.cie.2023.109718
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The smart workshop is a powerful tool for manufacturing companies to reduce waste and improve production efficiency through real-time data analysis for self-organized production. Automated Guided Vehicles (AGVs) have been widely used for material handling in smart workshop due to their high degree of autonomy, flexibility and powerful end-to-end capability to cope with logistics tasks in production modes such as multiple species and small batch, and mass customization. However, the highly dynamic, complex and uncertain nature of the smart job shop environment makes production scheduling with insufficient transportation resources in mind a challenge. To this end, this paper addresses the dynamic flexible job shop scheduling problem with insufficient transportation resources (DFJSP-ITR), and learn high-quality priority dispatching rule (PDR) end-to-end to minimize makespan by the proposed deep reinforcement learning (DRL) method. To achieve integrated decision making for operation, machine and AGV, an architecture based on heterogeneous graph neural network (GNN) and DRL is proposed. Considering the impact of different AGV distribution methods on the scheduling objective, this paper compares two different AGV distribution methods. Experiments show that the proposed method has superiority and good generalization ability compared with the current PDRs-based methods regardless of the AGV distribution strategy used.
引用
收藏
页数:17
相关论文
共 41 条
  • [1] Flexible job-shop scheduling with transportation resources
    Berterottiere, Lucas
    Dauzere-Peres, Stephane
    Yugma, Claude
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 312 (03) : 890 - 909
  • [2] Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
  • [3] A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM
    BRUCKER, P
    JURISCH, B
    SIEVERS, B
    [J]. DISCRETE APPLIED MATHEMATICS, 1994, 49 (1-3) : 107 - 127
  • [4] An MILP for scheduling problems in an FMS with one vehicle
    Caumond, A.
    Lacomme, P.
    Moukrim, A.
    Tchernev, N.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (03) : 706 - 722
  • [5] Dai HJ, 2018, Arxiv, DOI arXiv:1704.01665
  • [6] A priority scheduling approach for flexible job shops with multiple process plans
    Doh, Hyoung-Ho
    Yu, Jae-Min
    Kim, Ji-Su
    Lee, Dong-Ho
    Nam, Sung-Ho
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2013, 51 (12) : 3748 - 3764
  • [7] A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion
    Gao, Kai Zhou
    Suganthan, Ponnuthurai Nagaratnam
    Chua, Tay Jin
    Chong, Chin Soon
    Cai, Tian Xiang
    Pan, Qan Ke
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (21) : 7652 - 7663
  • [8] Dynamic scheduling for flexible job shop using a deep reinforcement learning approach
    Gui, Yong
    Tang, Dunbing
    Zhu, Haihua
    Zhang, Yi
    Zhang, Zequn
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 180
  • [9] Transfer-robot task scheduling in flexible job shop
    Ham, Andy
    [J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2020, 31 (07) : 1783 - 1793
  • [10] Optimal scheduling of AGVs in a reentrant blocking job-shop
    Heger, Jens
    Voss, Thomas
    [J]. 11TH CIRP CONFERENCE ON INTELLIGENT COMPUTATION IN MANUFACTURING ENGINEERING, 2018, 67 : 41 - 45