A comparative evaluation of heuristics forthe adjacency problem in facility layout planning

DOI10.1080/002075497195849MaRDI QIDQ4245203zbMATH OpenOpenAlexFDO

Authors Gerhard Wäscher, J. Merker

Publication date 28 August 2000

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/002075497195849

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• Two new heuristic algorithms for the maximal planar layout problem
• A New Graph-Theoretic Heuristic for Facility Layout
• Facilities layout generalized model solved by n-boundary shortest path heuristics
• The facility layout problem

Cited in

(5)

• Location and layout planning. A survey
• Two new heuristic algorithms for the maximal planar layout problem
• Facilities layout generalized model solved by n-boundary shortest path heuristics
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
• Detailed layout planning for irregularly-shaped machines with transportation path design

This page was built for publication: A comparative evaluation of heuristics forthe adjacency problem in facility layout planning

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