CELLULAR MANUFACTURING LAYOUT DESIGN USING HEURISTIC CLUSTERING ALGORITHM AND LPP MODEL

S. Ramesh, N. Arunkumar, R. Vijayaraj
{"title":"CELLULAR MANUFACTURING LAYOUT DESIGN USING HEURISTIC CLUSTERING ALGORITHM AND LPP MODEL","authors":"S. Ramesh, N. Arunkumar, R. Vijayaraj","doi":"10.7166/32-2-2340","DOIUrl":null,"url":null,"abstract":"This mathematical model forms machine cells, optimises the costs of unassigned machines and components, and designs the shop floor cell layout to have minimal movement of materials. The complete similarity measure algorithm forms machine cells and part families in a refined form. Later, exceptional elements are eliminated in the optimisation model by using machine duplication and sub-contracting of parts. Then the shop floor layout is designed to have optimised material movements between and within cells. An evaluation of the cell formation algorithm’ performance is done on the benchmark problems of various batch sizes to reveal the process’s capability compared with other similar methods. The data of machining times are acquired and tabulated in a part incidence matrix, which is used as input for the algorithm. The results from the linear programming optimisation model are that costs are saved, machines are duplicated, parts are sub-contracted, and there are inter- and intra- cellular movements. Finally, the output of the inbound facility design is the floor layout, which has machine cell clusters within the optimised floor area.","PeriodicalId":404746,"journal":{"name":"The South African Journal of Industrial Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The South African Journal of Industrial Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7166/32-2-2340","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This mathematical model forms machine cells, optimises the costs of unassigned machines and components, and designs the shop floor cell layout to have minimal movement of materials. The complete similarity measure algorithm forms machine cells and part families in a refined form. Later, exceptional elements are eliminated in the optimisation model by using machine duplication and sub-contracting of parts. Then the shop floor layout is designed to have optimised material movements between and within cells. An evaluation of the cell formation algorithm’ performance is done on the benchmark problems of various batch sizes to reveal the process’s capability compared with other similar methods. The data of machining times are acquired and tabulated in a part incidence matrix, which is used as input for the algorithm. The results from the linear programming optimisation model are that costs are saved, machines are duplicated, parts are sub-contracted, and there are inter- and intra- cellular movements. Finally, the output of the inbound facility design is the floor layout, which has machine cell clusters within the optimised floor area.
基于启发式聚类算法和LPP模型的元胞制造布局设计
这个数学模型形成了机器单元,优化了未分配机器和组件的成本,并设计了车间单元布局,以减少材料的移动。完整的相似性度量算法以一种精炼的形式形成机器单元和零件族。然后,通过机器复制和零件分包,消除了优化模型中的异常因素。然后,车间布局被设计为优化单元之间和单元内部的材料运动。在不同批大小的基准问题上对细胞形成算法的性能进行了评估,以揭示该方法与其他类似方法的性能比较。加工次数数据被采集并制成零件关联矩阵,作为算法的输入。线性规划优化模型的结果是节省了成本,复制了机器,分包了零件,并且存在细胞间和细胞内的运动。最后,入站设施设计的输出是楼层布局,在优化的楼层面积内拥有机器单元集群。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信