.png){kind=icon}
返回
Efficient algorithm for cell formation with sequence data, machine replications and alternative process routings
.png){kind=icon}
PRE
AI
DOI：10.1080/00207540310001652914.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Cell formation is an important problem in the design of a cellular manufacturing system. Despite a large number of papers on cell formation being published, only a handful incorporate operation sequence in intercell move calculations and consider alternative process routings, cell size, production volume and allocating units of identical machines into different cells. Modelling the above factors makes the cell formation problem complex but more realistic. The paper develops a model and solution methodology for a problem of cell formation to minimize the sum of costs of intercell moves, machine investment and machine operating costs considering all the factors mentioned above. An algorithm comprised of simulated annealing and local search heuristics has been developed to solve the model. A limited comparison of the proposed algorithm with an optimal solution generated by complete enumeration of small problems indicates that the algorithm produces a solution of excellent quality. Large problems with 100 parts and 50 machine types are efficiently solved using the algorithm.
Keyword:
GROUP-TECHNOLOGY
MANUFACTURING SYSTEMS
IDENTICAL MACHINES
DESIGN
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
A concurrent approach to cell formation and assignment of identical machines in group technology
PREAI
分享收藏
查看更多内容