Enhancing Mass Customization Manufacturing: Multiobjective Metaheuristic Algorithms for flow shop Production in Smart Industry

Diego Rossit, Daniel Rossit, Sergio Nesmachnow
{"title":"Enhancing Mass Customization Manufacturing: Multiobjective Metaheuristic Algorithms for flow shop Production in Smart Industry","authors":"Diego Rossit, Daniel Rossit, Sergio Nesmachnow","doi":"arxiv-2407.15802","DOIUrl":null,"url":null,"abstract":"The current landscape of massive production industries is undergoing\nsignificant transformations driven by emerging customer trends and new smart\nmanufacturing technologies. One such change is the imperative to implement mass\ncustomization, wherein products are tailored to individual customer\nspecifications while still ensuring cost efficiency through large-scale\nproduction processes. These shifts can profoundly impact various facets of the\nindustry. This study focuses on the necessary adaptations in shop-floor\nproduction planning. Specifically, it proposes the use of efficient\nevolutionary algorithms to tackle the flowshop with missing operations,\nconsidering different optimization objectives: makespan, weighted total\ntardiness, and total completion time. An extensive computational\nexperimentation is conducted across a range of realistic instances,\nencompassing varying numbers of jobs, operations, and probabilities of missing\noperations. The findings demonstrate the competitiveness of the proposed\napproach and enable the identification of the most suitable evolutionary\nalgorithms for addressing this problem. Additionally, the impact of the\nprobability of missing operations on optimization objectives is discussed.","PeriodicalId":501347,"journal":{"name":"arXiv - CS - Neural and Evolutionary Computing","volume":"24 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Neural and Evolutionary Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.15802","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The current landscape of massive production industries is undergoing significant transformations driven by emerging customer trends and new smart manufacturing technologies. One such change is the imperative to implement mass customization, wherein products are tailored to individual customer specifications while still ensuring cost efficiency through large-scale production processes. These shifts can profoundly impact various facets of the industry. This study focuses on the necessary adaptations in shop-floor production planning. Specifically, it proposes the use of efficient evolutionary algorithms to tackle the flowshop with missing operations, considering different optimization objectives: makespan, weighted total tardiness, and total completion time. An extensive computational experimentation is conducted across a range of realistic instances, encompassing varying numbers of jobs, operations, and probabilities of missing operations. The findings demonstrate the competitiveness of the proposed approach and enable the identification of the most suitable evolutionary algorithms for addressing this problem. Additionally, the impact of the probability of missing operations on optimization objectives is discussed.
加强大规模定制制造:智能工业流程车间生产的多目标元搜索算法
在新兴客户趋势和新型智能制造技术的推动下,当前大规模生产行业的格局正在发生重大转变。其中一个变化就是必须实施大规模定制,即在通过大规模生产流程确保成本效益的同时,根据客户的具体要求定制产品。这些转变会对行业的各个方面产生深远影响。本研究的重点是车间生产计划的必要调整。具体来说,考虑到不同的优化目标:生产周期、加权总延迟时间和总完成时间,本研究提出使用高效的演化算法来解决缺失作业的流动车间问题。在一系列现实实例中进行了广泛的计算实验,包括不同数量的作业、操作和缺失操作概率。实验结果证明了所提出方法的竞争力,并确定了最适合解决该问题的进化算法。此外,还讨论了缺失操作概率对优化目标的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信