A cell formation algorithm: Hypergraph approximation - Cut tree
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol.109, no.3, pp.686-702, 1998 (SCI-Expanded, Scopus)
- Publication Type: Article / Article
- Volume: 109 Issue: 3
- Publication Date: 1998
- Doi Number: 10.1016/s0377-2217(97)00143-4
- Journal Name: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Page Numbers: pp.686-702
- Middle East Technical University Affiliated: No
Abstract
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.