利用神经进化增强拓扑对流程时间不确定和灵活维护的混合流程车间问题进行动态调度

IF 2.5 Q2 ENGINEERING, INDUSTRIAL
Yarong Chen, Junjie Zhang, Mudassar Rauf, Jabir Mumtaz, Shenquan Huang
{"title":"利用神经进化增强拓扑对流程时间不确定和灵活维护的混合流程车间问题进行动态调度","authors":"Yarong Chen,&nbsp;Junjie Zhang,&nbsp;Mudassar Rauf,&nbsp;Jabir Mumtaz,&nbsp;Shenquan Huang","doi":"10.1049/cim2.12119","DOIUrl":null,"url":null,"abstract":"<p>A hybrid flow shop is pivotal in modern manufacturing systems, where various emergencies and disturbances occur within the smart manufacturing context. Efficiently solving the dynamic hybrid flow shop scheduling problem (HFSP), characterised by dynamic release times, uncertain job processing times, and flexible machine maintenance has become a significant research focus. A NeuroEvolution of Augmenting Topologies (NEAT) algorithm is proposed to minimise the maximum completion time. To improve the NEAT algorithm's efficiency and effectiveness, several features were integrated: a multi-agent system with autonomous interaction and centralised training to develop the parallel machine scheduling policy, a maintenance-related scheduling action for optimal maintenance decision learning, and a proactive scheduling action to avoid waiting for jobs at decision moments, thereby exploring a broader solution space. The performance of the trained NEAT model was experimentally compared with the Deep Q-Network (DQN) and five classical priority dispatching rules (PDRs) across various problem scales. The results show that the NEAT algorithm achieves better solutions and responds more quickly to dynamic changes than DQN and PDRs. Furthermore, generalisation test results demonstrate NEAT's rapid problem-solving ability on test instances different from the training set.</p>","PeriodicalId":33286,"journal":{"name":"IET Collaborative Intelligent Manufacturing","volume":"6 3","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cim2.12119","citationCount":"0","resultStr":"{\"title\":\"Dynamic scheduling of hybrid flow shop problem with uncertain process time and flexible maintenance using NeuroEvolution of Augmenting Topologies\",\"authors\":\"Yarong Chen,&nbsp;Junjie Zhang,&nbsp;Mudassar Rauf,&nbsp;Jabir Mumtaz,&nbsp;Shenquan Huang\",\"doi\":\"10.1049/cim2.12119\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A hybrid flow shop is pivotal in modern manufacturing systems, where various emergencies and disturbances occur within the smart manufacturing context. Efficiently solving the dynamic hybrid flow shop scheduling problem (HFSP), characterised by dynamic release times, uncertain job processing times, and flexible machine maintenance has become a significant research focus. A NeuroEvolution of Augmenting Topologies (NEAT) algorithm is proposed to minimise the maximum completion time. To improve the NEAT algorithm's efficiency and effectiveness, several features were integrated: a multi-agent system with autonomous interaction and centralised training to develop the parallel machine scheduling policy, a maintenance-related scheduling action for optimal maintenance decision learning, and a proactive scheduling action to avoid waiting for jobs at decision moments, thereby exploring a broader solution space. The performance of the trained NEAT model was experimentally compared with the Deep Q-Network (DQN) and five classical priority dispatching rules (PDRs) across various problem scales. The results show that the NEAT algorithm achieves better solutions and responds more quickly to dynamic changes than DQN and PDRs. Furthermore, generalisation test results demonstrate NEAT's rapid problem-solving ability on test instances different from the training set.</p>\",\"PeriodicalId\":33286,\"journal\":{\"name\":\"IET Collaborative Intelligent Manufacturing\",\"volume\":\"6 3\",\"pages\":\"\"},\"PeriodicalIF\":2.5000,\"publicationDate\":\"2024-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cim2.12119\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Collaborative Intelligent Manufacturing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/cim2.12119\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, INDUSTRIAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Collaborative Intelligent Manufacturing","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/cim2.12119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

摘要

在现代制造系统中,混合流程车间至关重要,因为在智能制造背景下会出现各种紧急情况和干扰。高效解决动态混合流程车间调度问题(HFSP)已成为一项重要的研究重点,该问题的特点是动态释放时间、不确定的作业处理时间和灵活的机器维护。我们提出了一种增强拓扑神经进化(NEAT)算法,以最小化最大完成时间。为了提高 NEAT 算法的效率和效果,该算法集成了几个功能:具有自主交互和集中训练功能的多代理系统,用于制定并行机器调度策略;与维护相关的调度行动,用于优化维护决策学习;主动调度行动,用于避免在决策时刻等待作业,从而探索更广阔的解决方案空间。实验比较了训练有素的 NEAT 模型与深度 Q 网络(DQN)和五种经典优先调度规则(PDR)在不同问题规模下的性能。结果表明,与 DQN 和 PDR 相比,NEAT 算法能获得更好的解决方案,并能更快地响应动态变化。此外,泛化测试结果表明 NEAT 在不同于训练集的测试实例上具有快速解决问题的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Dynamic scheduling of hybrid flow shop problem with uncertain process time and flexible maintenance using NeuroEvolution of Augmenting Topologies

Dynamic scheduling of hybrid flow shop problem with uncertain process time and flexible maintenance using NeuroEvolution of Augmenting Topologies

A hybrid flow shop is pivotal in modern manufacturing systems, where various emergencies and disturbances occur within the smart manufacturing context. Efficiently solving the dynamic hybrid flow shop scheduling problem (HFSP), characterised by dynamic release times, uncertain job processing times, and flexible machine maintenance has become a significant research focus. A NeuroEvolution of Augmenting Topologies (NEAT) algorithm is proposed to minimise the maximum completion time. To improve the NEAT algorithm's efficiency and effectiveness, several features were integrated: a multi-agent system with autonomous interaction and centralised training to develop the parallel machine scheduling policy, a maintenance-related scheduling action for optimal maintenance decision learning, and a proactive scheduling action to avoid waiting for jobs at decision moments, thereby exploring a broader solution space. The performance of the trained NEAT model was experimentally compared with the Deep Q-Network (DQN) and five classical priority dispatching rules (PDRs) across various problem scales. The results show that the NEAT algorithm achieves better solutions and responds more quickly to dynamic changes than DQN and PDRs. Furthermore, generalisation test results demonstrate NEAT's rapid problem-solving ability on test instances different from the training set.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IET Collaborative Intelligent Manufacturing
IET Collaborative Intelligent Manufacturing Engineering-Industrial and Manufacturing Engineering
CiteScore
9.10
自引率
2.40%
发文量
25
审稿时长
20 weeks
期刊介绍: IET Collaborative Intelligent Manufacturing is a Gold Open Access journal that focuses on the development of efficient and adaptive production and distribution systems. It aims to meet the ever-changing market demands by publishing original research on methodologies and techniques for the application of intelligence, data science, and emerging information and communication technologies in various aspects of manufacturing, such as design, modeling, simulation, planning, and optimization of products, processes, production, and assembly. The journal is indexed in COMPENDEX (Elsevier), Directory of Open Access Journals (DOAJ), Emerging Sources Citation Index (Clarivate Analytics), INSPEC (IET), SCOPUS (Elsevier) and Web of Science (Clarivate Analytics).
×
引用
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学术官方微信