.png){kind=icon}
返回
A cell formation algorithm: Hypergraph approximation - Cut tree
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(97)00143-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new cell formation technique is presented and analyzed in this paper. The cell formation problem is defined using the hypergraph representation of the manufacturing systems. The proposed method approximates the hypergraph model by graphs so that the cuts are less affected by the approximation. Consequently, a Gomory-Hu cut tree of the graph approximation is obtained. The minimum cuts between all pairs of vertices are calculated easily by means of this tree, and a partition tree is produced. Our cell formation algorithm successively cuts the partition tree. The algorithm is subjected to an experimentation of randomly generated manufacturing situations. The algorithm is compared with other cell formation techniques as well. (C) 1998 Published by Elsevier Science B.V. All rights reserved.
Keyword:
manufacturing
modeling
cell formation
graph theory
hypergraphs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Molecular Dynamics Analysis of the Effect of F on the Structure of Molten Na2O-NaF-Al2O3-SiO2 System
OAAI
OAAI分享收藏 没有更多内容
没有更多内容