Commonality analysis: A linear cell clustering algorithm for group technology
International Journal of Production ResearchPublished 1 December 1989
Jerry C. Wei, Gary M. Kern
Citations113
SJR quartileQ1
SJR score2.24
SNIP2.56
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new linear clustering algorithm that is fast, simple and quite flexible is presented that is based on the calculation of a commonality score which indicates the similarity in the way two machines are used in the shop to manufacture the products or parts.
Abstract
Numerous researchers have suggested methods for clustering machines into manufacturing cells in a Group Technology environment. Many of these methods are numerically complex. This paper presents a new linear clustering algorithm that is fast, simple and quite flexible. The algorithm is based on the calculation of a commonality score which indicates the similarity in the way two machines are used in the shop to manufacture the products or parts.
Keywords
Engineering
International Journal of Production ResearchMachine-component grouping in production flow analysis: an approach using a rank order clustering algorithm
794 Citations1980John R. King
Operations ResearchProblem Decomposition and Data Reorganization by a Clustering Technique
711 Citations1972William T. McCormick, Paul J. Schweitzer +1 more
The bond energy algorithm operates upon a raw input object-object or object-attribute data array by permuting its rows and columns in order to find informative variable groups and their interrelations.
International Journal of Production ResearchMachine-component group formation in group technology: review and extension
690 Citations1982John R. King, Vizes Nakornchai
International Journal of Production ResearchThe generalized group technology concept
546 Citations1987Andrew Kusiak
Journal of Manufacturing SystemsEfficient solving of the group technology problem
378 Citations1987Andrew Kusiak, Wing S. Chow
IIE TransactionsApplication of the Similarity Coefficient Method in Group Technology
336 Citations1986Hamid Seifoddini, Philip M. Wolfe
The new model improves the existing models based on SCM by dealing with the duplication of bottleneck machines and by employing special data storage and analysis techniques which greatly simplify the machine-component grouping process.
International Journal of Production ResearchMachine-component cell formation in group technology: MACE
321 Citations1984P.H. Waghodekar, Sumanta Kumar Sahu
Journal of Operations ManagementProcedures for the part family/machine group identification problem in cellular manufacturing
284 Citations1986Urban Wemmerlöv, Nancy Lea Hyer
It can be concluded that cell formation, despite the reliance on computerized procedures, is a process that is difficult to formalize and that requires a large portion of human insight and decision making.
International Journal of Production ResearchEntropic measures of manufacturing flexibility
205 Citations1987Vinod Kumar
Annals of Operations ResearchThe part families problem in flexible manufacturing systems
186 Citations1985Andrew Kusiak
Two new methodologies to overcome the drawbacks of the classical approach to parts grouping are developed and are very easy to implement because they take advantage of the information already stored in the CAD system.
Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)Strategic subcontracting for efficient disaggregated manufacturing
182 Citations1986Kuldeep Kumar, Anthony Vannelli
IEEE Transactions on Systems Man and CyberneticsA Clustering and Data-Reorganizing Algorithm
83 Citations1975James R. Slagle, C. L. Chang +1 more
A clustering and data-reorganizing algorithm based on the concept of the shortest spanning path of a graph is given that can be used to reorganize and/or cluster a large file of data.
Operations ResearchTechnical Note—Clustering a Data Array and the Traveling-Salesman Problem
79 Citations1974Jan Karel Lenstra
A clustering of a nonnegative M×N array is obtained by permuting its rows and columns and can be stated as two traveling-salesman problems.
IEEE Transactions on Systems Man and CyberneticsAn Efficient Clustering Algorithm
62 Citations1976M.V. Bhat, A. Haupt
An efficient algorithm for data reorganization and clustering is presented and has some decided merits over the algorithm of Slagle et al., which provided the immediate stimulus for this work.
IEEE Transactions on Systems Man and CyberneticsAn Efficient Cluster Identification Algorithm
59 Citations1987Andrew Kusiak, Wing S. Chow
A cluster identification algorithm which has relatively low computational time complexity O(2mn) is developed and allows checking for the existence of clusters and determines the number of mutually separable clusters.