.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
manufacturing
modeling
cell formation
graph theory
hypergraphs
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available