Solution procedures for the dynamic facility layout problem

DOI10.1023/A:1018904806854zbMath0895.90162OpenAlexW1516892042MaRDI QIDQ1383273

Timothy L. Urban

Publication date: 2 April 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018904806854

zbMATH Keywords

heuristicscombinatorial optimizationbounding proceduresfacility layoutdynamic modelsrepeated solution of quadratic assignment problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Production models (90B30) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (6)

Recent advances in dynamic facility layout research ⋮ The zone-based dynamic facility layout problem ⋮ A survey for the quadratic assignment problem ⋮ Formulating and solving sustainable stochastic dynamic facility layout problem: a key to sustainable operations ⋮ Layout optimization considering production uncertainty and routing flexibility ⋮ Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem

Uses Software

• GRASP_QAP

This page was built for publication: Solution procedures for the dynamic facility layout problem