A Multi-Type data driven framework for solving flexible job shop scheduling problem considering multiple production resource states

IF 6.5 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Industrial Engineering Pub Date : 2025-02-01 DOI:10.1016/j.cie.2024.110835
Siyang Ji, Zipeng Wang, Jihong Yan
{"title":"A Multi-Type data driven framework for solving flexible job shop scheduling problem considering multiple production resource states","authors":"Siyang Ji,&nbsp;Zipeng Wang,&nbsp;Jihong Yan","doi":"10.1016/j.cie.2024.110835","DOIUrl":null,"url":null,"abstract":"<div><div>The development of flexible manufacturing models has been propelled by Industry 4.0, making it a cornerstone of intelligent manufacturing. To address the challenges posed by frequent order changes and multiple production state disruptions in highly customized manufacturing processes. In this paper, a new framework for solving dynamic flexible job shop scheduling problem is proposed for the first time. A state constraint representation method is proposed, which can decouple the relationship between the scheduling optimization algorithm and various constraint conditions. The feasibility of the method is validated under six dynamic production states, including the shift calendar for equipment, equipment availability, equipment failures, equipment maintenance, job rework, and the insertion of jobs. Moreover, an improved Genetic Algorithm is deployed within the framework to address scheduling optimization. Compared to multiple algorithms, the proposed method is competitive in terms of optimization effectiveness and efficiency. Furthermore, the framework is deployed in a certain aerospace engine machining workshop, and the results demonstrate that the proposed framework is competitive in performing complex tasks.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110835"},"PeriodicalIF":6.5000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835224009574","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

The development of flexible manufacturing models has been propelled by Industry 4.0, making it a cornerstone of intelligent manufacturing. To address the challenges posed by frequent order changes and multiple production state disruptions in highly customized manufacturing processes. In this paper, a new framework for solving dynamic flexible job shop scheduling problem is proposed for the first time. A state constraint representation method is proposed, which can decouple the relationship between the scheduling optimization algorithm and various constraint conditions. The feasibility of the method is validated under six dynamic production states, including the shift calendar for equipment, equipment availability, equipment failures, equipment maintenance, job rework, and the insertion of jobs. Moreover, an improved Genetic Algorithm is deployed within the framework to address scheduling optimization. Compared to multiple algorithms, the proposed method is competitive in terms of optimization effectiveness and efficiency. Furthermore, the framework is deployed in a certain aerospace engine machining workshop, and the results demonstrate that the proposed framework is competitive in performing complex tasks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
考虑多种生产资源状态的柔性作业车间调度问题的多类型数据驱动框架
工业4.0推动了柔性制造模式的发展,使其成为智能制造的基石。解决在高度定制的制造过程中频繁的订单变更和多生产状态中断所带来的挑战。本文首次提出了一种求解动态柔性作业车间调度问题的新框架。提出了一种状态约束表示方法,可以将调度优化算法与各种约束条件之间的关系解耦。在六种动态生产状态下验证了该方法的可行性,包括设备轮班日历、设备可用性、设备故障、设备维护、作业返工和作业插入。此外,在框架内部署了一种改进的遗传算法来解决调度优化问题。与多种算法相比,该方法在优化效果和效率方面具有竞争力。最后,将该框架应用于某航空发动机加工车间,结果表明该框架在执行复杂任务时具有一定的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Industrial Engineering
Computers & Industrial Engineering 工程技术-工程:工业
CiteScore
12.70
自引率
12.70%
发文量
794
审稿时长
10.6 months
期刊介绍: Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.
期刊最新文献
Competing for the most profitable tour: the orienteering interdiction game A two-stage approach for collaborative scheduling of closed-loop manufacturing considering dynamic power cost: An enhanced Benders decomposition optimization Budget-scalable inference-time hybrid MCTS for enhancing DRL-based flexible job shop scheduling Integrated workforce and territory planning for home social care under variable demand A Data-Driven Multi-Objective optimization framework for dynamic job shop scheduling with order Acceptance, inventory and Energy-Aware decisions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1