4.7 Article

Sequence generation for multi-task scheduling in cloud manufacturing with deep reinforcement learning

期刊

JOURNAL OF MANUFACTURING SYSTEMS
卷 67, 期 -, 页码 315-337

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.jmsy.2023.02.009

关键词

Cloud manufacturing; Multi-task scheduling; Sequence generation algorithm; Deep reinforcement learning; Double Deep Q-networks

向作者/读者索取更多资源

Cloud manufacturing is a manufacturing model that provides on-demand manufacturing services to consumers. Scheduling is a crucial problem for cloud manufacturing, especially when dealing with multiple composite tasks. This research combines sequence generation algorithms with deep reinforcement learning to address cloud manufacturing scheduling problems.
Cloud manufacturing is a manufacturing model that aims to deliver on-demand manufacturing services to consumers. Scheduling is an important problem that needs to be addressed carefully and effectively for cloud manufacturing to achieve that aim. Cloud manufacturing allows consumers to submit their requirements to the cloud platform simultaneously and therefore requires cloud manufacturing scheduling systems to be able to handle multiple tasks effectively. It is further complicated when multiple composite tasks are submitted to the system and to be addressed. A vast majority of existing studies have proposed various algorithms, including meta-heuristics, heuristics, and reinforcement learning algorithms, to address cloud manufacturing scheduling (CMfg-Sch) problems, but only a very small fraction of them deal with scheduling of multiple composition tasks with deep reinforcement learning. In this work, we leverage DRL coupled with sequence generation for addressing CMfg-Sch problems. Different from all existing works, we first propose two sequence generation al-gorithms for generating scheduling sequences of multiple composite tasks prior to scheduling. Coupled with this a Deep Q-Networks (DQN) and a Double DQN-based scheduling algorithms are proposed, respectively. Perfor-mance of the proposed algorithms is compared against seven baseline algorithms using makespan, cost, and reliability as evaluation metrics. Comparison indicates that sequence generation algorithm II (SGA-II) overall has a greater advantage over algorithm I (SGA-I), especially in terms of the makespan, and the Double DQN-based scheduling algorithm outperforms the DQN-based algorithm, which in turn performs better than other base-line algorithms.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据