New heuristic for the dynamic layout problem

DOI10.1057/PALGRAVE.JORS.2601646MaRDI QIDQ4661238zbMATH OpenOpenAlexFDO

Authors Erdal Erel, Jay B. Ghosh, John T. Simon

Publication date 4 April 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/24371

zbMATH Keywords

heuristicslayout planningmathematical programming

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Heuristics for the dynamic facility layout problem with unequal-area departments
• Solution procedures for the dynamic facility layout problem
• Static and Dynamic Layout Problems with Varying Areas
• The Dynamics of Plant Layout
• A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem

Cited in

(13)

• An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem
• Solution procedures for the dynamic facility layout problem
• Simulated annealing heuristics for the dynamic facility layout problem
• A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem
• DASH: dynamic approach for switching heuristics
• The Dynamics of Plant Layout
• scientific article; zbMATH DE number 1253047 (Why is no real title available?)
• Static and Dynamic Layout Problems with Varying Areas
• Reconfigurable layout problem
• Layout design in dynamic environments: analytical issues
• Recent advances in dynamic facility layout research
• The zone-based dynamic facility layout problem
• A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach

This page was built for publication: New heuristic for the dynamic layout problem

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