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

DOI10.1080/00207549408957064zbMath0897.90116MaRDI QIDQ4394343

No author found.

Publication date: 19 October 1998

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549408957064

zbMATH Keywords

minimum spanning tree; group technology; machine cell part family formation

Mathematics Subject Classification ID

90B30: Production models

Related Items

Configuration of cellular manufacturing systems using association rule induction, CF-GGA: A grouping genetic algorithm for the cell formation problem, Incremental cell formation considering alternative machines, Tabu search approach based on a similarity coefficient for cell formation in generalized group technology, A hybrid grouping genetic algorithm for the cell formation problem, An ant colony optimization metaheuristic for machine-part cell formation problems, On the use of the asymptotic forms of the Boolean matrix for designing cellular manufacturing systems. -- An improved approach, A simulated annealing approach for manufacturing cell formation with multiple identical machines., Impact of the replacement heuristic in a grouping genetic algorithm., Joint determination of machine cells and linear intercell layout, Ant colony recognition systems for part clustering problems, Grouping PCB_sfor set-up reduction: a maximum spanning tree approach

Cites Work

• Grouping of parts and components in flexible manufacturing systems
• A graph partitioning procedure for machine assignment and cell formation in group technology†
• An ideal seed non-hierarchical clustering algorithm for cellular manufacturing
• A method for finding minimal bottle-neck cells for grouping part-machine families†
• ZODIAC—an algorithm for concurrent formation of part-families and machine-cells
• Problem Decomposition and Data Reorganization by a Clustering Technique