Finding part-machine families using graph partitioning techniques

DOI10.1080/00207549608904999MaRDI QIDQ4230183zbMATH OpenOpenAlexFDO

Authors Scott W. Hadley

Publication date 1 March 1999

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

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

zbMATH Keywords

cellular manufacturinggroup technology

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• A TSP-based heuristic for forming machine groups and part families
• Part-machine grouping using a multi-objective cluster analysis
• A method for finding minimal bottle-neck cells for grouping part-machine families†
• Graph partitioning using learning automata
• A fast parallel algorithm to recognize partitionable graphs
• scientific article; zbMATH DE number 736961
• scientific article; zbMATH DE number 1942408
• Partitioning graphs into connected parts
• Partitioning Graphs into Connected Parts

Cites work

• A Gomory-Hu cut tree representation of a netlist partitioning problem
• A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing
• A New Heuristic for Partitioning the Nodes of a Graph
• An Algorithm for Partitioning the Nodes of a Graph
• An ideal seed non-hierarchical clustering algorithm for cellular manufacturing
• Approximation techniques for hypergraph partitioning problems
• scientific article; zbMATH DE number 49142 (Why is no real title available?)

Cited in

(10)

• A cell formation algorithm: Hypergraph approximation -- cut tree
• The sustainable cell formation problem: manufacturing cell creation with machine modification costs
• Minimizing the number of exceptional edges in cellular manufacturing problem
• A graph partitioning procedure for machine assignment and cell formation in group technology†
• 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
• A TSP-based heuristic for forming machine groups and part families
• Part family identification using a simple genetic algorithm
• Modified Hamiltonian chain: A graph theoretic approach to group technology
• A network flow model of group technology

This page was built for publication: Finding part-machine families using graph partitioning techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230183)