Two graph-theoretic procedures for an improved solution to the facilities layout problem
From MaRDI portal
Publication:3354559
DOI10.1080/00207549108948041zbMath0729.90548OpenAlexW1997409776MaRDI QIDQ3354559
Publication date: 1991
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549108948041
Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Two new heuristic algorithms for the maximal planar layout problem ⋮ TESSA—A new greedy heuristic for facilities layout planning ⋮ A reply to ‘A note on “On TESSA”’ ⋮ A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem ⋮ A note on 'Maximally weighted graph theoretic facilities design planning' ⋮ On the worst case performance of TESSA
Cites Work
- Construction properties of combinatorial deltahedra
- The facility layout problem
- Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
- Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
- The Efficiency of Computer Algorithms for Plant Layout
