Improved lion swarm optimization algorithm to solve the multi-objective rescheduling of hybrid flowshop with limited buffer

IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Journal of King Saud University-Computer and Information Sciences Pub Date : 2024-06-01 DOI:10.1016/j.jksuci.2024.102077
Tingyu Guan, Tingxin Wen, Bencong Kou
{"title":"Improved lion swarm optimization algorithm to solve the multi-objective rescheduling of hybrid flowshop with limited buffer","authors":"Tingyu Guan,&nbsp;Tingxin Wen,&nbsp;Bencong Kou","doi":"10.1016/j.jksuci.2024.102077","DOIUrl":null,"url":null,"abstract":"<div><p>As the realities of production and operation in green and intelligent workshops become more variable, the adverse risks arising from disruptions to modernized workshop energy consumption schedules and customer churn caused by dynamic events are increasing. In order to solve those problems, we take the intelligent hybrid flow shop as the research subject, use buffer capacity and automated guided vehicles (AGVs) transport devices as resource constraints, construct a multi-objective rescheduling model that considers both energy consumption and customer satisfaction. According to the model characteristics, an improved lion swarm optimization algorithm (ILSO) is designed to solve the above model. To improve the initial solution quality and global search capability of the algorithm, ILSO is improved by combining the reverse learning initialization strategy of Logistic chaotic mapping with the tabu search strategy. The results of experiments on the proposed algorithm with different sizes of arithmetic cases and real cases in the workshop indicate that ILSO can effectively solve the bi-objective rescheduling problem oriented to inserting orders, and the proposed model can provide green dynamic scheduling solutions for manufacturing enterprises to achieve the purpose of transformation to green intelligent manufacturing.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":null,"pages":null},"PeriodicalIF":5.2000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824001666/pdfft?md5=5d17fbfec8a74d4f04910f433ddf7824&pid=1-s2.0-S1319157824001666-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of King Saud University-Computer and Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1319157824001666","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

As the realities of production and operation in green and intelligent workshops become more variable, the adverse risks arising from disruptions to modernized workshop energy consumption schedules and customer churn caused by dynamic events are increasing. In order to solve those problems, we take the intelligent hybrid flow shop as the research subject, use buffer capacity and automated guided vehicles (AGVs) transport devices as resource constraints, construct a multi-objective rescheduling model that considers both energy consumption and customer satisfaction. According to the model characteristics, an improved lion swarm optimization algorithm (ILSO) is designed to solve the above model. To improve the initial solution quality and global search capability of the algorithm, ILSO is improved by combining the reverse learning initialization strategy of Logistic chaotic mapping with the tabu search strategy. The results of experiments on the proposed algorithm with different sizes of arithmetic cases and real cases in the workshop indicate that ILSO can effectively solve the bi-objective rescheduling problem oriented to inserting orders, and the proposed model can provide green dynamic scheduling solutions for manufacturing enterprises to achieve the purpose of transformation to green intelligent manufacturing.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用改进的狮群优化算法解决具有有限缓冲区的混合流水车间的多目标重新调度问题
随着绿色智能车间生产和运营的实际情况越来越多变,动态事件导致的现代化车间能耗计划中断和客户流失所带来的不利风险也越来越大。为了解决这些问题,我们以智能混合流水车间为研究对象,以缓冲能力和自动导引车(AGV)运输装置为资源约束,构建了一个同时考虑能耗和客户满意度的多目标重调度模型。根据模型特点,设计了一种改进的狮群优化算法(ILSO)来求解上述模型。为了提高算法的初始解质量和全局搜索能力,将 Logistic 混沌映射的反向学习初始化策略与 tabu 搜索策略相结合,对 ILSO 进行了改进。在研讨会上对所提算法进行了不同大小算例和实际算例的实验,结果表明 ILSO 能有效解决面向插单的双目标重调度问题,所提模型能为制造企业提供绿色动态调度解决方案,达到向绿色智能制造转型的目的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
10.50
自引率
8.70%
发文量
656
审稿时长
29 days
期刊介绍: In 2022 the Journal of King Saud University - Computer and Information Sciences will become an author paid open access journal. Authors who submit their manuscript after October 31st 2021 will be asked to pay an Article Processing Charge (APC) after acceptance of their paper to make their work immediately, permanently, and freely accessible to all. The Journal of King Saud University Computer and Information Sciences is a refereed, international journal that covers all aspects of both foundations of computer and its practical applications.
期刊最新文献
Heterogeneous emotional contagion of the cyber–physical society A novel edge intelligence-based solution for safer footpath navigation of visually impaired using computer vision Improving embedding-based link prediction performance using clustering A sharding blockchain protocol for enhanced scalability and performance optimization through account transaction reconfiguration RAPID: Robust multi-pAtch masker using channel-wise Pooled varIance with two-stage patch Detection
×
引用
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