Finding part-machine families using graph partitioning techniques
From MaRDI portal
Publication:4230183
DOI10.1080/00207549608904999zbMath0928.90021OpenAlexW1977524039MaRDI QIDQ4230183
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
Related Items (2)
A network flow model of group technology ⋮ The sustainable cell formation problem: manufacturing cell creation with machine modification costs
Cites Work
- Unnamed Item
- A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing
- Approximation techniques for hypergraph partitioning problems
- A Gomory-Hu cut tree representation of a netlist partitioning problem
- An ideal seed non-hierarchical clustering algorithm for cellular manufacturing
- A New Heuristic for Partitioning the Nodes of a Graph
- An Algorithm for Partitioning the Nodes of a Graph
This page was built for publication: Finding part-machine families using graph partitioning techniques