A network flow model of group technology
From MaRDI portal
Publication:597530
DOI10.1016/S0895-7177(03)90032-XzbMath1080.90042OpenAlexW2057974376MaRDI QIDQ597530
Publication date: 6 August 2004
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(03)90032-x
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Grouping of parts and components in flexible manufacturing systems
- The maximum concurrent flow problem
- A graph partitioning procedure for machine assignment and cell formation in group technology†
- Multi-Terminal Network Flows
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- An Efficient Heuristic Procedure for Partitioning Graphs
- Finding part-machine families using graph partitioning techniques
This page was built for publication: A network flow model of group technology