针对动态增材制造排程的超序执行深度强化学习

IF 9.1 1区 计算机科学 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Mingyue Sun , Jiyuchen Ding , Zhiheng Zhao , Jian Chen , George Q. Huang , Lihui Wang
{"title":"针对动态增材制造排程的超序执行深度强化学习","authors":"Mingyue Sun ,&nbsp;Jiyuchen Ding ,&nbsp;Zhiheng Zhao ,&nbsp;Jian Chen ,&nbsp;George Q. Huang ,&nbsp;Lihui Wang","doi":"10.1016/j.rcim.2024.102841","DOIUrl":null,"url":null,"abstract":"<div><p>Additive Manufacturing (AM) has revolutionized the production landscape by enabling on-demand customized manufacturing. However, the efficient management of dynamic AM orders poses significant challenges for production planning and scheduling. This paper addresses the dynamic scheduling problem considering batch processing, random order arrival and machine eligibility constraints, aiming to minimize total tardiness in a parallel non-identical AM machine environment. To tackle this problem, we propose the out-of-order enabled dueling deep Q network (O3-DDQN) approach. In the proposed approach, the problem is formulated as a Markov decision process (MDP). Three-dimensional features, encompassing dynamic orders, AM machines, and delays, are extracted using a ‘look around’ method to represent the production status at a rescheduling point. Additionally, five novel composite scheduling rules based on the out-of-order principle are introduced for selection when an AM machine completes processing or a new order arrives. Moreover, we design a reward function that is strongly correlated with the objective to evaluate the agent’s chosen action. Experimental results demonstrate the superiority of the O3-DDQN approach over single scheduling rules, randomly selected rules, and the classic DQN method. The average improvement rate of performance reaches 13.09% compared to composite scheduling rules and random rules. Additionally, the O3-DDQN outperforms the classic DQN agent with a 6.54% improvement rate. The O3-DDQN algorithm improves scheduling in dynamic AM environments, enhancing productivity and on-time delivery. This research contributes to advancing AM production and offers insights into efficient resource allocation.</p></div>","PeriodicalId":21452,"journal":{"name":"Robotics and Computer-integrated Manufacturing","volume":"91 ","pages":"Article 102841"},"PeriodicalIF":9.1000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Out-of-order execution enabled deep reinforcement learning for dynamic additive manufacturing scheduling\",\"authors\":\"Mingyue Sun ,&nbsp;Jiyuchen Ding ,&nbsp;Zhiheng Zhao ,&nbsp;Jian Chen ,&nbsp;George Q. Huang ,&nbsp;Lihui Wang\",\"doi\":\"10.1016/j.rcim.2024.102841\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Additive Manufacturing (AM) has revolutionized the production landscape by enabling on-demand customized manufacturing. However, the efficient management of dynamic AM orders poses significant challenges for production planning and scheduling. This paper addresses the dynamic scheduling problem considering batch processing, random order arrival and machine eligibility constraints, aiming to minimize total tardiness in a parallel non-identical AM machine environment. To tackle this problem, we propose the out-of-order enabled dueling deep Q network (O3-DDQN) approach. In the proposed approach, the problem is formulated as a Markov decision process (MDP). Three-dimensional features, encompassing dynamic orders, AM machines, and delays, are extracted using a ‘look around’ method to represent the production status at a rescheduling point. Additionally, five novel composite scheduling rules based on the out-of-order principle are introduced for selection when an AM machine completes processing or a new order arrives. Moreover, we design a reward function that is strongly correlated with the objective to evaluate the agent’s chosen action. Experimental results demonstrate the superiority of the O3-DDQN approach over single scheduling rules, randomly selected rules, and the classic DQN method. The average improvement rate of performance reaches 13.09% compared to composite scheduling rules and random rules. Additionally, the O3-DDQN outperforms the classic DQN agent with a 6.54% improvement rate. The O3-DDQN algorithm improves scheduling in dynamic AM environments, enhancing productivity and on-time delivery. This research contributes to advancing AM production and offers insights into efficient resource allocation.</p></div>\",\"PeriodicalId\":21452,\"journal\":{\"name\":\"Robotics and Computer-integrated Manufacturing\",\"volume\":\"91 \",\"pages\":\"Article 102841\"},\"PeriodicalIF\":9.1000,\"publicationDate\":\"2024-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Robotics and Computer-integrated Manufacturing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0736584524001285\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Robotics and Computer-integrated Manufacturing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0736584524001285","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

快速成型制造(AM)实现了按需定制生产,从而彻底改变了生产格局。然而,如何有效管理动态 AM 订单给生产计划和调度带来了巨大挑战。本文探讨了动态调度问题,考虑了批量处理、随机订单到达和机器资格约束,旨在最大限度地减少并行非相同 AM 机器环境中的总迟到时间。为解决这一问题,我们提出了失序启用决斗深 Q 网络(O3-DDQN)方法。在所提出的方法中,问题被表述为马尔可夫决策过程(MDP)。使用 "环顾 "方法提取了包括动态订单、AM 机器和延迟在内的三维特征,以表示重新安排点的生产状态。此外,我们还引入了五种基于失序原则的新型复合调度规则,用于在 AM 机器完成加工或新订单到来时进行选择。此外,我们还设计了一个与目标密切相关的奖励函数,用于评估代理选择的行动。实验结果表明,O3-DDQN 方法优于单一调度规则、随机选择规则和经典 DQN 方法。与复合调度规则和随机规则相比,性能平均提高了 13.09%。此外,O3-DDQN 的改进率为 6.54%,优于经典 DQN 代理。O3-DDQN 算法改善了动态 AM 环境中的调度,提高了生产率和准时交货率。这项研究有助于推动 AM 生产,并为高效资源分配提供了见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Out-of-order execution enabled deep reinforcement learning for dynamic additive manufacturing scheduling

Additive Manufacturing (AM) has revolutionized the production landscape by enabling on-demand customized manufacturing. However, the efficient management of dynamic AM orders poses significant challenges for production planning and scheduling. This paper addresses the dynamic scheduling problem considering batch processing, random order arrival and machine eligibility constraints, aiming to minimize total tardiness in a parallel non-identical AM machine environment. To tackle this problem, we propose the out-of-order enabled dueling deep Q network (O3-DDQN) approach. In the proposed approach, the problem is formulated as a Markov decision process (MDP). Three-dimensional features, encompassing dynamic orders, AM machines, and delays, are extracted using a ‘look around’ method to represent the production status at a rescheduling point. Additionally, five novel composite scheduling rules based on the out-of-order principle are introduced for selection when an AM machine completes processing or a new order arrives. Moreover, we design a reward function that is strongly correlated with the objective to evaluate the agent’s chosen action. Experimental results demonstrate the superiority of the O3-DDQN approach over single scheduling rules, randomly selected rules, and the classic DQN method. The average improvement rate of performance reaches 13.09% compared to composite scheduling rules and random rules. Additionally, the O3-DDQN outperforms the classic DQN agent with a 6.54% improvement rate. The O3-DDQN algorithm improves scheduling in dynamic AM environments, enhancing productivity and on-time delivery. This research contributes to advancing AM production and offers insights into efficient resource allocation.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Robotics and Computer-integrated Manufacturing
Robotics and Computer-integrated Manufacturing 工程技术-工程:制造
CiteScore
24.10
自引率
13.50%
发文量
160
审稿时长
50 days
期刊介绍: The journal, Robotics and Computer-Integrated Manufacturing, focuses on sharing research applications that contribute to the development of new or enhanced robotics, manufacturing technologies, and innovative manufacturing strategies that are relevant to industry. Papers that combine theory and experimental validation are preferred, while review papers on current robotics and manufacturing issues are also considered. However, papers on traditional machining processes, modeling and simulation, supply chain management, and resource optimization are generally not within the scope of the journal, as there are more appropriate journals for these topics. Similarly, papers that are overly theoretical or mathematical will be directed to other suitable journals. The journal welcomes original papers in areas such as industrial robotics, human-robot collaboration in manufacturing, cloud-based manufacturing, cyber-physical production systems, big data analytics in manufacturing, smart mechatronics, machine learning, adaptive and sustainable manufacturing, and other fields involving unique manufacturing technologies.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信