A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing
From MaRDI portal
Publication:1327210
DOI10.1016/0166-218X(92)00173-JzbMath0804.90066OpenAlexW1976385829MaRDI QIDQ1327210
Brigitte Jaumard, Alain Hertz, Celso Carneiro Ribeiro
Publication date: 18 July 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(92)00173-j
hypergraphbipartite graphpolynomial timecell formationgroup technologybottleneck machinesmaximum weighted stable setminimum weighted node covering problem
Related Items
On an optimization problem occurring in FMSs: A hypergraph-theoretical formulation, Finding part-machine families using graph partitioning techniques
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- A method for finding minimal bottle-neck cells for grouping part-machine families†
- A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs