Cell Formation Problem with Alternative Routes and Machine Reliability: Review, Analysis, and Future Developments

IF 2.3 4区 社会学 Q1 SOCIAL SCIENCES, INTERDISCIPLINARY
Systems Pub Date : 2024-08-07 DOI:10.3390/systems12080288
Paulo Figueroa-Torrez, Orlando Durán, Miguel Sellitto
{"title":"Cell Formation Problem with Alternative Routes and Machine Reliability: Review, Analysis, and Future Developments","authors":"Paulo Figueroa-Torrez, Orlando Durán, Miguel Sellitto","doi":"10.3390/systems12080288","DOIUrl":null,"url":null,"abstract":"The Cell Formation Problem (CFP) is a widely studied issue that aims to group machines effectively based on criteria such as productivity, lower costs, and greater efficiency. In recent years, more characteristics were summarized relating to this problem. This paper provides a bibliographic examination of methodologies addressing the CFP in cellular manufacturing, focusing on novel approaches such as alternative routes and machine reliability. The articles were obtained from Scopus and Web of Science and filtered using the PRISMA methodology. Classification based on objective functions, constraints, and methodologies facilitated informative visualizations for analysis. Findings indicate a focus on capital utilization optimization, with cost reduction via intercellular moves minimization as the primary objective. Common constraints include limits on the number of machines per cell, restricting machines to a single cell and singular production routes per part. The genetic algorithm predominates as a non-exact solution approach, while the “ε-constraint” method is commonly used. This study offers insights into contemporary trends in solving the CFP with alternative routings and machine reliability, aiding researchers and professionals in the field to improve the quality of their investigations.","PeriodicalId":36394,"journal":{"name":"Systems","volume":"19 1","pages":""},"PeriodicalIF":2.3000,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Systems","FirstCategoryId":"90","ListUrlMain":"https://doi.org/10.3390/systems12080288","RegionNum":4,"RegionCategory":"社会学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"SOCIAL SCIENCES, INTERDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

The Cell Formation Problem (CFP) is a widely studied issue that aims to group machines effectively based on criteria such as productivity, lower costs, and greater efficiency. In recent years, more characteristics were summarized relating to this problem. This paper provides a bibliographic examination of methodologies addressing the CFP in cellular manufacturing, focusing on novel approaches such as alternative routes and machine reliability. The articles were obtained from Scopus and Web of Science and filtered using the PRISMA methodology. Classification based on objective functions, constraints, and methodologies facilitated informative visualizations for analysis. Findings indicate a focus on capital utilization optimization, with cost reduction via intercellular moves minimization as the primary objective. Common constraints include limits on the number of machines per cell, restricting machines to a single cell and singular production routes per part. The genetic algorithm predominates as a non-exact solution approach, while the “ε-constraint” method is commonly used. This study offers insights into contemporary trends in solving the CFP with alternative routings and machine reliability, aiding researchers and professionals in the field to improve the quality of their investigations.
具有替代路线和机器可靠性的单元形成问题:回顾、分析和未来发展
单元形成问题(CFP)是一个被广泛研究的问题,其目的是根据生产率、降低成本和提高效率等标准对机器进行有效分组。近年来,人们总结了更多与该问题相关的特征。本文从文献学角度对解决单元制造中 CFP 问题的方法进行了研究,重点关注替代路线和机器可靠性等新方法。文章来自 Scopus 和 Web of Science,并采用 PRISMA 方法进行了筛选。根据目标函数、约束条件和方法进行分类,有助于进行信息可视化分析。研究结果表明,资本利用率优化是重点,首要目标是通过细胞间移动最小化来降低成本。常见的约束条件包括限制每个单元的机器数量、将机器限制在单个单元以及每个零件的单一生产路线。遗传算法作为一种非精确的求解方法占主导地位,而 "ε-约束 "方法也很常用。本研究深入探讨了利用替代路线和机器可靠性求解 CFP 的当代趋势,有助于该领域的研究人员和专业人士提高研究质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Systems
Systems Decision Sciences-Information Systems and Management
CiteScore
2.80
自引率
15.80%
发文量
204
审稿时长
11 weeks
×
引用
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学术官方微信