Two graph-theoretic procedures for an improved solution to the facilities layout problem

DOI10.1080/00207549108948041MaRDI QIDQ3354559zbMATH OpenOpenAlexFDO

Authors Latif A. al-Hakim

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80)

Cites work

• Construction properties of combinatorial deltahedra
• Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
• Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
• The Efficiency of Computer Algorithms for Plant Layout
• The facility layout problem

Cited in

(6)

• Two new heuristic algorithms for the maximal planar layout problem
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
• TESSA—A new greedy heuristic for facilities layout planning
• On the worst case performance of TESSA
• A reply to ‘A note on “On TESSA”’
• A note on 'Maximally weighted graph theoretic facilities design planning'

This page was built for publication: Two graph-theoretic procedures for an improved solution to the facilities layout problem

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