.png){kind=icon}
返回
Multi-resource constrained dynamic workshop scheduling based on proximal policy optimisation
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2021.1975057.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multi-resource constrained dynamic workshop scheduling is a complex and challenging task in discrete manufacturing. In this paper, to obtain a high-performance scheduling in limited time, this problem is modelled into a Markov decision process, and solved by proximal policy optimisation algorithm, which can learn from the simulated workshop environment directly. A multi-modal hybrid neural network is used in the model to make good use of numerical state features representing workshop environment information and graphical state features representing constraint information during the learning process. Multi-label technique is used in this paper to decouple the output acts of jobs, machines, tools, and workers. Action mask technique coding the constraints is also used to prune invalid exploration. The experimental results show that compared with heuristic rules such as weighted shortest processing time, weighted modified due date, weighted cost over time, apparent tardiness cost and other reinforcement learning methods such as DeepRM and DeepRM2, the performance of the proposed method is at least $ 1.138\% $ 1.138% better in scheduling penalty.
Keyword:
Dynamic workshop scheduling
Markov decision process
multi-resource constrained scheduling
reinforcement learning
proximal policy optimisation
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
A Review on Swarm Intelligence and Evolutionary Algorithms for Solving Flexible Job Shop Scheduling Problems求解柔性作业车间调度问题的群体智能和进化算法综述
OAAI
OAAI分享收藏Study of bi-directional buck-boost converter topologies for application in electrical vehicle motor drives应用于电动汽车电机驱动的双向buck-boost变换器拓扑研究
PREAI
分享收藏分享收藏Surrogate-Assisted Symbiotic Organisms Search Algorithm for Parallel Batch Processor Scheduling
PREAI
分享收藏Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints调度规则，以最大程度地减少具有设置和日历约束的并行机问题中的总迟到OAAI
OAAI分享收藏
查看更多内容