计算机科学
调度(生产过程)
作业车间调度
遗传算法
数学优化
遗传算法调度
动态优先级调度
单机调度
集合(抽象数据类型)
最优化问题
流水车间调度
强化学习
扩展(谓词逻辑)
算法
公平份额计划
分布式计算
作者
Tao Zhang,Dan You,Ziyan Zhao,Shouguang Wang,MengChu Zhou
标识
DOI:10.1109/tsmc.2025.3613306
摘要
A flexible job-shop scheduling problem with lot streaming (FJSP-LS) is an extension of flexible job-shop scheduling problems (FJSPs). In it, jobs are allowed to be split into multiple sublots for separate/concurrent processing and transportation, thereby improving job-shop productivity. However, it faces a drastically enlarged solution space due to such sublot splitting, which makes it challenging to find its optimal solution. In this study, a reinforcement-learning-enhanced knowledge-guided genetic algorithm (RKGA) is proposed to solve it. In particular, we design a knowledge-guided strategy that extracts sublot features from sublot schemes (SSs) of an elite solution set as knowledge. This knowledge is then used to guide the SS mutation and state-space generation of the environment in reinforcement learning (RL). Moreover, a method combining perturbation operations and RL is designed to help the algorithm escape from local optima. Extensive computational experiments have been carried out, and the results validate the superiority of RKGA over the state-of-the-art algorithms in solving FJSP-LS.
科研通智能强力驱动
Strongly Powered by AbleSci AI