Principal component analysis for evaluating the feasibility of cellular manufacturing without initial machine-part matrix clustering

We present a set of diagnostic tools for machine-part matrix clustering. Machine-part matrix clustering is traditionally viewed as the first step in designing a Cellular Manufacturing System. Clustering is achieved by permuting the rows and columns of the matrix to get a Block Diagonal Form (BDF). Without actual matrix clustering being done, most methods for clustering fail to predict objectively the adaptability of the given matrix for Cellular Manufacturing. This paper presents an approach which predicts clusters accurately without initial machine-part matrix clustering. In addition, it also provides quantitative information on whether the matrix encourages Cellular Manufacturing without obtaining or partitioning the BDF. Lastly, the method also identifies the part families corresponding to each machine group in the same sequence for both dimensions of the matrix. This yields a BDF rather than a Block Checkerboard Form for the clustered matrix which happens when the machine groups and part families are ...

[1]  Moshe M. Barash,et al.  Design of a cellular manufacturing system: A syntactic pattern recognition approach , 1986 .

[2]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[3]  R. Cattell.  The Scree Test For The Number Of Factors. , 1966, Multivariate behavioral research.

[4]  J. William Gavett,et al.  Three Heuristic Rules for Sequencing Jobs to a Single Production Facility , 1965 .

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

[6]  J. Gower,et al.  Minimum Spanning Trees and Single Linkage Cluster Analysis , 1969 .

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

[8]  Andrew Kusiak,et al.  A branch-and-bound algorithm for solving the group technology problem , 1991 .

[9]  Warren J. Boe,et al.  A close neighbour algorithm for designing cellular manufacturing systems , 1991 .

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

[11]  S. Irani,et al.  Cluster first-sequence last heuristics for generating block diagonal forms for a machine-part matrix , 1993 .

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

[13]  H. Seifoddini.  Machine-component group analysis versus the similarity coefficient method in cellular manufacturing application , 1990 .

[14]  G. A. Ferguson,et al.  The concept of parsimony in factor analysis , 1954 .

[15]  Nicos Christofides,et al.  The Shortest Hamiltonian Chain of a Graph , 1970 .

[16]  Rasaratnam Logendran,et al.  A workload based model for minimizing total intercell and intracell moves in cellular manufacturing , 1990 .

[17]  Mihalis Yannakakis,et al.  A polynomial algorithm for the MIN CUT linear arrangement of trees , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[18]  R. Cattell,et al.  A Comprehensive Trial Of The Scree And Kg Criteria For Determining The Number Of Factors. , 1977, Multivariate behavioral research.

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

[20]  J. E. Jackson.  A User's Guide to Principal Components , 1991 .

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

[22]  James R. Slagle,et al.  A Clustering and Data-Reorganizing Algorithm , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

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

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

[25]  D. C. D. Pocock,et al.  Methods of Deriving Multi-Factor Uniform Regions , 1969 .

[26]  Chun Zhang,et al.  Concurrent formation of part families and machine cells based on the fuzzy set theory , 1992 .

[27]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[28]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

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

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

[31]  C. Mosier.  An experiment investigating the application of clustering procedures and similarity coefficients to the GT machine cell formation problem , 1989 .

[32]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[33]  Gregory V. Frazier,et al.  Seed selection procedures for cell formation heuristics , 1991 .

[34]  Ibrahim Al-Qattan,et al.  Designing flexible manufacturing cells using a branch and bound method , 1990 .

[35]  Shu Ming Ng,et al.  Bond Energy, Rectilinear Distance and a Worst-case Bound for the Group Technology Problem , 1991 .

[36]  K. Y. Tam,et al.  An operation sequence based similarity coefficient for part families formations , 1990 .

[37]  J. Miltenburg,et al.  A comparative evaluation of nine well-known algorithms for solving the cell formation problem in group technology , 1991 .

[38]  Nicos Christofides,et al.  Technical Note - Bounds for the Travelling-Salesman Problem , 1972, Oper. Res..

[39]  J. C. Wei,et al.  A capacity constrained multiobjective cell formation method , 1990 .

[40]  Tarun Gupta,et al.  Production data based similarity coefficient for machine-component grouping decisions in the design of a cellular manufacturing system , 1990 .

[41]  Inyong Ham,et al.  Layout Planning for Group Technology , 1985 .

[42]  J. Witte.  The use of similarity coefficients in production flow analysis , 1980 .

[43]  G. Harhalakis,et al.  Manufacturing cell design using simulated annealing: An industrial application , 1990, J. Intell. Manuf..

[44]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[45]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

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

[47]  F. N. David,et al.  Geological Factor Analysis , 1976 .

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

[49]  Asoo J. Vakharia,et al.  Designing a Cellular Manufacturing System: A Materials Flow Approach Based on Operation Sequences , 1990 .

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

[51]  W. Velicer,et al.  Comparison of five rules for determining the number of components to retain. , 1986 .

[52]  Mikell P. Groover,et al.  Automation, Production Systems, and Computer-Integrated Manufacturing , 1987 .

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