计算机科学 ›› 2026, Vol. 53 ›› Issue (1): 231-240.doi: 10.11896/jsjkx.250100088

• 人工智能 • 上一篇    下一篇

基于双层注意力网络的强化学习方法求解柔性作业车间调度问题

王皓焱, 李崇寿, 李天瑞   

  1. 西南交通大学计算机与人工智能学院 成都 611756
  • 收稿日期:2025-01-14 修回日期:2025-03-29 发布日期:2026-01-08
  • 通讯作者: 李崇寿(lics@swjtu.edu.cn)
  • 作者简介:(19983459395@163.com)
  • 基金资助:
    国家自然科学基金(62202395,62176221)

Reinforcement Learning Method for Solving Flexible Job Shop Scheduling Problem Based onDouble Layer Attention Network

WANG Haoyan, LI Chongshou, LI Tianrui   

  1. School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu 611756, China
  • Received:2025-01-14 Revised:2025-03-29 Online:2026-01-08
  • About author:WANG Haoyan,born in 2001,postgra-duate.Her main research interests include deep reinforcement learning and job shop scheduling.
    LI Chongshou,born in 1988,Ph.D,associate professor,is a member of CCF(No.J8308M).His main research in-terests include multi-scale data intelligence,AI and applied optimization.
  • Supported by:
    National Natural Science Foundation of China(62202395,62176221).

摘要: 柔性作业车间调度问题作为作业车间调度问题的一种变体,因其广泛的适用性成为现代制造业智能化转型中的重要研究内容。近年来,深度强化学习被用于求解柔性作业车间调度问题,但允许将操作分配给具有不同处理时间的多台兼容机器的特点给决策和状态表示带来了额外的复杂性。为此,提出了一种基于改进的注意力机制和近端策略优化算法的端到端深度强化学习框架,用于解决柔性作业车间调度问题。基于异构析取图结构的特点,设计了一种基于分层注意力思想的双层注意力网络,包括节点级注意力层与类型级注意力层,充分提取操作与机器间的复杂信息,以支持高质量的调度决策。在合成数据集和公开数据集上的实验结果表明,所提方法在保持高效率的同时,性能和泛化能力均优于传统的优先调度规则方法和目前先进的深度强化学习方法。

关键词: 柔性作业车间调度问题, 深度强化学习, 图注意力网络, 注意力机制

Abstract: Flexible job shop scheduling problem(FJSP),as a variant of the job shop scheduling problem,has become an important research topic in the intelligent transformation of modern manufacturing industry due to the wide applicability.In recent years,deep reinforcement learning(DRL) has been applied to solve flexible job shop scheduling problems.However,the characteristic that operations can be assigned to multiple compatible machines with different processing times brings additional complexity to decision making and state representation.This paper proposes an end-to-end deep reinforcement learning framework based on an improved attention mechanism and proximal policy optimization algorithm to solve the FJSP.Considering the characteristics of heterogeneous disjunction graph structure,it designs a double-layer attention network based on hierarchical attention,including node-level attention layers and type-level attention layers,to fully extract the complex information between operations and machines to support high-quality scheduling decisions.Experimental results on synthetic and public datasets show that the proposed method outperforms traditional priority dispatching rules and currently state-of-the-art DRL methods in both of performance and generalization ability while maintaining high efficiency.

Key words: Flexible job shop scheduling problem, Deep reinforcement learning, Graph attention network, Attention mechanism

中图分类号: 

  • TP181
[1]SONG W,CHEN X Y,LI Q,et al.Flexible Job-Shop Scheduling via Graph Neural Network and Deep Reinforcement Learning[J].IEEE Transactions on Industrial Informatics,2023,19(2):1600-1610.
[2]WANG R Q,WANG G,SUN J,et al.Flexible Job Shop Scheduling via Dual Attention Network-Based Reinforcement Learning[J].IEEE Transactions on Neural Networks and Learning Systems,2024,35(3):3091-3102.
[3]MENG L L,ZHANG C Y,REN Y P,et al.Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling[J].Computers & Industrial Engineering,2020,142:106347.
[4]ÖZGÜVEN C,ÖZBAKR L,YAVUZ Y.Mathematical Models for Jobshop Scheduling Problems with Routing and Process Plan Flexibility[J].Applied Mathematical Modelling,2010,34(6):1539-1548.
[5]MÜLLER D,MÜLLER M G,KRESS D,et al.An AlgorithmSelection Approach for the Flexible Job Shop Scheduling Problem:Choosing Constraint Programming Solvers through Machine Learning[J].EuropeanJournal of Operational Research,2022,302(3):874-891.
[6]MATI Y,REZG N,XIE X L.An integrated greedy heuristic for a flexible job shop scheduling problem[C]//Proceedings of the IEEE International Conference on Systems,Man and Cyberne-tics.2001:2534-2539.
[7]HAUPTR.A Survey of Priority Rule-based Scheduling[J].Operations Research Spektrum,1989,11(1):3-16.
[8]SELS V,GHEYSEN N,VANHOUCK M.A Comparison of Priority Rules for the Job Shop Scheduling Problem under Different Flow Time-and Tardiness-related Objective Functions[J].International Journal of Production Research,2012,50(15):4255-4270.
[9]ORTIZ M A,BEATANCOURT L E,NEGRETE K P,et al.Dispatching Algorithm for Production Programming of Flexible Job-shop Systems in the Smart Factory Industry[J].Annals of Operations Research,2018,264(1):409-433.
[10]ZHANG C,SONG W,CAO Z G,et al.Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning[C]//Proceedings of the 34th International Conference on Neural Information Processing Systems.Red Hook,NY:Curran Associates Inc.,2020:1621-1632.
[11]HAN B A,YANG J J.A Deep Reinforcement Learning BasedSolution for Flexible Job Shop Scheduling Problem[J].International Journal of Simulation Modelling,2021,20(2):375-386.
[12]HUANG R H,YANG C L,CHENG W C.Flexible job shop scheduling with due window a two-pheromone ant colony approach[J].International Journal of Production Economics,2013,141(2):685-697.
[13]LI X,LIANG G.An Effective Hybrid Genetic Algorithm and Tabu Search for Flexible Job Shop Scheduling Problem[J].International Journal of Production Economics,2016,174:93-110.
[14]MANOSIJ G,RITAM G,SARKAR R,et al.A Wrapper-filterFeature Selection Technique Based on Ant Colony Optimization[J].Neural Computing and Applications,2020,32(12):7839-7857.
[15]DEFERSHA F M,ROOYANI D.An Efficient Two-stage Genetic Algorithm for Flexible Job-shop Scheduling Problem with Sequence Dependent Attached/Detached Setup,Machine Release Date and Lag-Time[J].Computers and Industrial Engineering,2020,147:106605.
[16]WU X L,WU S M.An elitist quantum-inspired evolutionary algorithm for the flexible job-shop scheduling problem[J].Journal of Intelligent Manufacturing,2017,28(6):1441-1457.
[17]ZARROUK R,BENNOUR I E,JEMAI A.A two-level particle swarm optimization algorithm for the flexible job shop scheduling problem[J].Swarm Intelligence,2019,13(2):145-168.
[18]WANG Y L,STEIN B V,BACK T,et al.A Tailored NSGA-III Instantiation for Flexible Job Shop Scheduling[C]//2020 IEEE Symposium Series on Computational Intelligence.2020:2746-2753.
[19]GAO K Z,CAO Z G,ZHANG L,et al.A Review on Swarm Intelligence and Evolutionary Algorithms for Solving Flexible Job Shop Scheduling Problems[J].IEEE-CAA Journal of Automatica Sinica,2019,6(4):904-916.
[20]LEI K,GUO P,ZHAO W C,et al.A multi-action deep rein-forcement learning framework for flexible Job-shop scheduling problem[J].Expert Systems with Applications,2022,205:117796.
[21]LUO S,ZHANG L,FAN Y.Real-time Scheduling for Dynamic Partialno-wait Multiobjective Flexible Job Shop by Deep Reinforcement Learning[J].IEEE Transactions on Automation Science and Engineering,2022,19(4):3020-3038.
[22]WANG X,JI H Y,SHI C,et al.Heterogeneous Graph Attention Network[C]//Proceedings of the World Wide Web Conference.2019:2022-2032.
[23]XIE J,GAO L,PENG K K,et al.Review on Flexible Job Shop Scheduling[J].IET Collaborative Intelligent Manufacturing,2019,1(3):67-77.
[24]SOBEYKO O,MONCH L.Heuristic Approaches for Scheduling Jobs in Large-scale Flexible Job Shops[J].Computers and Ope-rations Research,2016,68:97-109.
[25]CHEN R H,YANG B,LI S,et al.A Self-learning Genetic Algorithm Based on Reinforcement Learning for Flexible Job-Shop Scheduling Problem[J].Computers and Industrial Engineering,2020,149:106778.
[26]LONG X J,ZHANG J T,QI X,et al.A Self-learning Artificial Bee Colony Algorithm Based on Reinforcement Learning for a Flexible Job-shop Scheduling Problem[J].Concurrency and Computation:Practice and Experience,2022(4):34.
[27]VELICKOVIC P,CUCURULL G,CASANOVA A,et al.Graph Attention Networks[C]//Proceedings of the International Conference on Learning Representations(ICLR).2018.
[28]BRODY S,ALON U,YAHAV E.How Attentive are Graph Attention Network[C]//Proceedings of the International Confe-rence on Learning Representations(ICLR).2022.
[29]SCHULMAN J,WOLSKI F,DHARIWAL P,et al.Proximalpolicy optimization algorithms[J].arXiv:1707.06347,2017.
[30]BRANDIMARTE P.Routing and scheduling in a flexible jobshop by tabu search[J].Annals of Operations Research,1993,41(3):157-183.
[31]HURINK J,JURISCH B,THOLE M.Tabu search for the job-shop scheduling problem with multi-purpose machines[J].OR Spektrum,1994,15(4):205-215.
[32]ROOYANI D,DEFERSHA F M.An Efficient Two-Stage Genetic Algorithm for Flexible Job-Shop Scheduling[C]//Procee-dings of 9th IFAC Conference on Manufacturing Modelling,Ma-nagement and Control(IFAC MIM).2019:2519-2524.
[33]LI X Y,GAO L.An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem[J].International Journal of Production Economics,2016,174:93-110.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!