An iterated greedy algorithm integrating job insertion strategy for distributed job shop scheduling problems

IF 12.2 1区 工程技术 Q1 ENGINEERING, INDUSTRIAL
Lin Huang , Dunbing Tang , Zequn Zhang , Haihua Zhu , Qixiang Cai , Shikui Zhao
{"title":"An iterated greedy algorithm integrating job insertion strategy for distributed job shop scheduling problems","authors":"Lin Huang ,&nbsp;Dunbing Tang ,&nbsp;Zequn Zhang ,&nbsp;Haihua Zhu ,&nbsp;Qixiang Cai ,&nbsp;Shikui Zhao","doi":"10.1016/j.jmsy.2024.10.014","DOIUrl":null,"url":null,"abstract":"<div><div>The distributed scheduling problem (DSP) becomes particularly important with the popularization of the distributed manufacturing mode. The distributed job shop scheduling problem (DJSP) is a typical representative of the DSP. It consists of two subproblems, assigning jobs to factories and determining the operation sequence on machines. Some benchmark instances have been proposed to test the performance of the DJSP approach, but most instances have not found the optimal solution. In this paper, an iterated greedy algorithm integrating job insertion (IGJI) is proposed to solve the DJSP. Firstly, a job insertion strategy based on idle time (JIIT) is designed for the insertion of a job into a factory. Secondly, JIIT is used in the reconstruction phase of IGJI, while three destruction-reconstruction methods are designed to balance the makespan among factories. Finally, tabu search is adopted in the local search phase of IGJI to improve the solution quality further. The performance of IGJI is tested on 240 benchmark instances, and the experimental results show that the solution quality of IGJI outperforms the other four state-of-the-art algorithms. In particular, IGJI has found 231 new solutions for these benchmark instances.</div></div>","PeriodicalId":16227,"journal":{"name":"Journal of Manufacturing Systems","volume":"77 ","pages":"Pages 746-763"},"PeriodicalIF":12.2000,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Manufacturing Systems","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0278612524002401","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

Abstract

The distributed scheduling problem (DSP) becomes particularly important with the popularization of the distributed manufacturing mode. The distributed job shop scheduling problem (DJSP) is a typical representative of the DSP. It consists of two subproblems, assigning jobs to factories and determining the operation sequence on machines. Some benchmark instances have been proposed to test the performance of the DJSP approach, but most instances have not found the optimal solution. In this paper, an iterated greedy algorithm integrating job insertion (IGJI) is proposed to solve the DJSP. Firstly, a job insertion strategy based on idle time (JIIT) is designed for the insertion of a job into a factory. Secondly, JIIT is used in the reconstruction phase of IGJI, while three destruction-reconstruction methods are designed to balance the makespan among factories. Finally, tabu search is adopted in the local search phase of IGJI to improve the solution quality further. The performance of IGJI is tested on 240 benchmark instances, and the experimental results show that the solution quality of IGJI outperforms the other four state-of-the-art algorithms. In particular, IGJI has found 231 new solutions for these benchmark instances.
针对分布式作业车间调度问题的集成作业插入策略的迭代贪婪算法
随着分布式生产模式的普及,分布式调度问题(DSP)变得尤为重要。分布式作业车间调度问题(DJSP)是 DSP 的典型代表。它由两个子问题组成,即向工厂分配作业和确定机器上的操作顺序。人们提出了一些基准实例来测试 DJSP 方法的性能,但大多数实例都没有找到最优解。本文提出了一种集成作业插入的迭代贪婪算法(IGJI)来求解 DJSP。首先,设计了一种基于空闲时间的作业插入策略(JIIT),用于将作业插入工厂。其次,在 IGJI 的重构阶段使用 JIIT,同时设计了三种销毁-重构方法来平衡各工厂之间的 makepan。最后,IGJI 的局部搜索阶段采用了 tabu 搜索,以进一步提高解的质量。在 240 个基准实例上测试了 IGJI 的性能,实验结果表明 IGJI 的解质量优于其他四种最先进的算法。特别是,IGJI 为这些基准实例找到了 231 个新解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Manufacturing Systems
Journal of Manufacturing Systems 工程技术-工程:工业
CiteScore
23.30
自引率
13.20%
发文量
216
审稿时长
25 days
期刊介绍: The Journal of Manufacturing Systems is dedicated to showcasing cutting-edge fundamental and applied research in manufacturing at the systems level. Encompassing products, equipment, people, information, control, and support functions, manufacturing systems play a pivotal role in the economical and competitive development, production, delivery, and total lifecycle of products, meeting market and societal needs. With a commitment to publishing archival scholarly literature, the journal strives to advance the state of the art in manufacturing systems and foster innovation in crafting efficient, robust, and sustainable manufacturing systems. The focus extends from equipment-level considerations to the broader scope of the extended enterprise. The Journal welcomes research addressing challenges across various scales, including nano, micro, and macro-scale manufacturing, and spanning diverse sectors such as aerospace, automotive, energy, and medical device manufacturing.
×
引用
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学术官方微信