.png){kind=icon}
返回
A spectral clustering algorithm for manufacturing cell formation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2009.04.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Manufacturing cell formation
Spectral clustering
Bipartite graph modeling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem制造单元形成问题的一种新的分支定界增强遗传算法
PREAI
分享收藏分享收藏
查看更多内容