A clustering algorithm for machine cell formation in group technology using minimum spanning trees

Abstract I address the machine cell part family formation problem in group technology. The minimum spanning tree (MST) For machines is constructed from which seeds to cluster components are generated. Seeds to cluster machines are obtained from component clusters. The process of alternate seed generation and clustering is continued until feasible solutions are obtained. Edges are removed from the MST to identify alternate starting seeds for clustering. The algorithm is tested with matrices available in the literature. The results compare favourably with existing methods.

[1]  John McAuley,et al.  Machine grouping for efficient production , 1972 .

[2]  Paul J. Schweitzer,et al.  Problem Decomposition and Data Reorganization by a Clustering Technique , 1972, Oper. Res..

[3]  Allan S. Carrie,et al.  Numerical taxonomy applied to group technology and plant layout , 1973 .

[4]  R. Rajagopalan,et al.  Design of cellular production systems A graph-theoretic approach , 1975 .

[5]  J. King Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm , 1980 .

[6]  D. A. Milner,et al.  Direct clustering algorithm for group formation in cellular manufacture , 1982 .

[7]  J. King,et al.  Machine-component group formation in group technology: review and extension , 1982 .

[8]  Larry R. Taube,et al.  The facets of group technology and their impacts on implementation--A state-of-the-art survey , 1985 .

[9]  Larry E. Stanfel,et al.  Machine clustering for economic production , 1985 .

[10]  Anthony Vannelli,et al.  Strategic subcontracting for efficient disaggregated manufacturing , 1986 .

[11]  Anthony Vannelli,et al.  A method for finding minimal bottle-neck cells for grouping part-machine families† , 1986 .

[12]  Andrew Kusiak,et al.  Grouping of parts and components in flexible manufacturing systems , 1986 .

[13]  M. Chandrasekharan,et al.  MODROC: an extension of rank order clustering for group technology , 1986 .

[14]  M. Chandrasekharan,et al.  An ideal seed non-hierarchical clustering algorithm for cellular manufacturing , 1986 .

[15]  M. Chandrasekharan,et al.  ZODIAC—an algorithm for concurrent formation of part-families and machine-cells , 1987 .

[16]  Ronald G. Asktn,et al.  A cost-based heuristic for group technology configuration† , 1987 .

[17]  A. Kusiak The generalized group technology concept , 1987 .

[18]  Andrew Kusiak,et al.  Group technology , 1987 .

[19]  Vinod Kumar,et al.  Entropic measures of manufacturing flexibility , 1987 .

[20]  A. Kusiak,et al.  Efficient solving of the group technology problem , 1987 .

[21]  F. Fred Choobineh,et al.  A framework for the design of cellular manufacturing systems , 1988 .

[22]  Henry C. Co,et al.  Configuring cellular manufacturing systems , 1988 .

[23]  Avraham Shtubt Modelling group technology cell formation as a generalized assignment problem , 1989 .

[24]  R. S. Lashkari,et al.  Machine grouping problem in cellular manufacturing systems ― an integer programming approach , 1989 .

[25]  M. Chandrasekharan,et al.  GROUPABIL1TY: an analysis of the properties of binary data matrices for group technology , 1989 .

[26]  T. Narendran,et al.  An assignment model for the part-families problem in group technology , 1990 .

[27]  Ronald G. Askin,et al.  A graph partitioning procedure for machine assignment and cell formation in group technology , 1990 .

[28]  Hui-Chuan Chen,et al.  A network approach to cell formation in cellular manufacturing , 1990 .

[29]  M. Chandrasekharan,et al.  Grouping efficacy: a quantitative criterion for goodness of block diagonal forms of binary matrices in group technology , 1990 .

[30]  G. Srinivasan,et al.  GRAFICS—a nonhierarchical clustering algorithm for group technology , 1991 .

[31]  Ronald G. Askin,et al.  A Hamiltonian path approach to reordering the part-machine matrix for cellular manufacturing , 1991 .

[32]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .