A polynomial-time algorithm for optimal clustering in a special class of {0, l} -matrices

The process of forming group technology based families for cellular manufacturing applications often entails the identification ofclusters in {0, l}-matrices. Most of the methods developed to date for cluster formation in this context employ heuristics that typically generate sub-optimal solutions (in terms of the number of exceptional elements). In this paper, we will describe a polynomial-time algorithm, based on a graph-theoretic approach, for optimal cluster formation in a class of {0, l}-matrices called vertex-tree graphic matrices. A comparison of the performance of this algorithm with popular heuristics is also provided. The algorithm can be used as a benchmarking tool for cluster formation heuristics.

[1]  G. F. Purcheck,et al.  Load balancing for group technology planning and control , 1979 .

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  F. Boctor.  A Jinear formulation of the machine-part cell formation problem , 1991 .

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

[5]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

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

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

[8]  Andrew Kusiak,et al.  Decomposition of manufacturing systems , 1988, IEEE J. Robotics Autom..

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

[10]  Nancy Lea Hyer,et al.  Cellular manufacturing in the U.S. industry: a survey of users , 1989 .

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

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

[13]  David F. Rogers,et al.  A goal programming approach to the cell formation problem , 1991 .

[14]  Harold J. Steudel,et al.  A dynamic programming based heuristic for machine grouping in manufacturing cell formation , 1987 .

[15]  Hoda A. ElMaraghy,et al.  Feature based expert parts assignment in cellular manufacturing , 1989 .

[16]  R. Swaminathan,et al.  Decomposition of /spl lcub/0,1/spl rcub/-matrices , 1994 .

[17]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[18]  G. Purcheck.  A Linear–Programming Method for the Combinatorial Grouping of an Incomplete Power Set , 1975 .

[19]  Donald K. Wagner,et al.  On the Consecutive-Retrieval Problem , 1994, SIAM J. Comput..

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

[21]  Jerry C. Wei,et al.  An Optimal Model for Cell Formation Decisions , 1990 .

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

[23]  John L. Burbidge,et al.  Production flow analysis , 1963 .