作业车间调度
计算机科学
调度(生产过程)
数学优化
强化学习
分布式计算
人工智能
布线(电子设计自动化)
计算机网络
数学
作者
Xianping Huang,Yong Chen,Wenchao Yi,Zhi Pei,Ziwen Cheng
出处
期刊:Applied sciences
[Multidisciplinary Digital Publishing Institute]
日期:2025-06-20
卷期号:15 (13): 6995-6995
摘要
With the advancement of logistics technology, Automated Guided Vehicles (AGVs) have been widely adopted in manufacturing enterprises due to their high flexibility and stability, particularly in flexible and discrete manufacturing domains such as tire production and electronic assembly. However, existing studies seldom systematically consider practical constraints such as limited AGV transport resources, AGV charging requirements, and charging station capacity limitations. To address this gap, this paper proposes a flexible job shop production-logistics collaborative scheduling model that incorporates transport and charging constraints, aiming to minimize the maximum makespan. To solve this problem, an improved PPO algorithm—CRGPPO-TKL—has been developed, which integrates candidate probability ratio calculations and a dynamic clipping mechanism based on target KL divergence to enhance the exploration capability and stability during policy updates. Experimental results demonstrate that the proposed method outperforms composite dispatching rules and mainstream DRL methods across multiple scheduling scenarios, achieving an average improvement of 8.2% and 10.5% in makespan, respectively. Finally, sensitivity analysis verifies the robustness of the proposed method with respect to parameter combinations.
科研通智能强力驱动
Strongly Powered by AbleSci AI