Tri-objective lot-streaming scheduling optimization for hybrid flow shops with uncertainties in machine breakdowns and job arrivals using an enhanced genetic programming hyper-heuristic

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2024-08-23 DOI:10.1016/j.cor.2024.106817
{"title":"Tri-objective lot-streaming scheduling optimization for hybrid flow shops with uncertainties in machine breakdowns and job arrivals using an enhanced genetic programming hyper-heuristic","authors":"","doi":"10.1016/j.cor.2024.106817","DOIUrl":null,"url":null,"abstract":"<div><p>Lot-streaming scheduling has been widely recognized as a means to improve shop productivity, but there is few research on lot-streaming scheduling problems under dynamic disturbances. To fill the gap, lot-streaming scheduling optimization approach for hybrid flow shops with uncertainties in machine breakdowns and job arrivals is proposed. A mathematical model is formulated with objectives of minimizing maximum tardiness, total idle energy consumption of the machine, and maximum makespan. Since the Genetic Programming Hyper Heuristic algorithm has better results in solving dynamic scheduling problems, a Collaborative Harmony Search-based Genetic Programming Hyper Heuristic (CHS-GPHH) is presented to solve the dynamic lot-streaming hybrid flow shop scheduling problem (DLS-HFSSP) with the two dynamic events occurring simultaneously. In the improved algorithm, a neighborhood structure based on harmony search is developed for lot splitting. To verify the effectiveness of the proposed approach, the various comparative studies c are conducted on the lot-streaming dynamic hybrid flow shop scheduling. The results demonstrate the effectiveness of each improvement component of the CHS-GPHH, and verify that CHS-GPHH is an effective approach to deal with DLS-HFSSP with the in all the scenarios.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1000,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824002892","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Lot-streaming scheduling has been widely recognized as a means to improve shop productivity, but there is few research on lot-streaming scheduling problems under dynamic disturbances. To fill the gap, lot-streaming scheduling optimization approach for hybrid flow shops with uncertainties in machine breakdowns and job arrivals is proposed. A mathematical model is formulated with objectives of minimizing maximum tardiness, total idle energy consumption of the machine, and maximum makespan. Since the Genetic Programming Hyper Heuristic algorithm has better results in solving dynamic scheduling problems, a Collaborative Harmony Search-based Genetic Programming Hyper Heuristic (CHS-GPHH) is presented to solve the dynamic lot-streaming hybrid flow shop scheduling problem (DLS-HFSSP) with the two dynamic events occurring simultaneously. In the improved algorithm, a neighborhood structure based on harmony search is developed for lot splitting. To verify the effectiveness of the proposed approach, the various comparative studies c are conducted on the lot-streaming dynamic hybrid flow shop scheduling. The results demonstrate the effectiveness of each improvement component of the CHS-GPHH, and verify that CHS-GPHH is an effective approach to deal with DLS-HFSSP with the in all the scenarios.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用增强型遗传编程超启发式优化具有机器故障和作业到达不确定性的混合流水车间的三目标批量流水排程
批量分流调度作为提高车间生产率的一种手段已被广泛认可,但有关动态干扰下批量分流调度问题的研究却很少。为了填补这一空白,本文提出了一种针对机器故障和作业到达不确定性的混合流动车间的批量流调度优化方法。该方法建立了一个数学模型,其目标是最大迟到时间、机器总闲置能耗和最大生产间隔最小化。由于遗传编程超启发式算法在解决动态调度问题时有更好的效果,因此提出了一种基于协作和谐搜索的遗传编程超启发式算法(CHS-GPHH),用于解决两个动态事件同时发生的动态批量流混合流车间调度问题(DLS-HFSSP)。在改进算法中,开发了一种基于和谐搜索的邻域结构,用于批量分割。为了验证所提方法的有效性,对批量流动态混合流车间调度进行了各种比较研究。结果证明了 CHS-GPHH 各改进部分的有效性,并验证了 CHS-GPHH 是一种在所有情况下处理 DLS-HFSSP 的有效方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Corporate risk stratification through an interpretable autoencoder-based model Re-direction in queueing networks with two customer types: The inter-departure analysis Multi objective optimization of human–robot collaboration: A case study in aerospace assembly line A deep reinforcement learning hyperheuristic for the covering tour problem with varying coverage Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1