Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem

DOI10.1016/0377-2217(92)90048-EzbMath0825.90459OpenAlexW2085298661MaRDI QIDQ1197698

Timothy L. Urban

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90048-e

Mathematics Subject Classification ID

Production models (90B30)

Related Items (4)

The zone-based dynamic facility layout problem ⋮ Price-sensitive demand for perishable items -- an EOQ model ⋮ Layout optimization considering production uncertainty and routing flexibility ⋮ Flexible machine layout design for dynamic and uncertain production environments

Cites Work

• Unnamed Item
• Unnamed Item
• Quadratic assignment problems
• An exact algorithm for the general quadratic assignment problem
• The facility layout problem
• Contributions to the quadratic assignment problem
• The Quadratic Assignment Problem
• Note—Comment on “The Dynamics of Plant Layout”
• The Dynamics of Plant Layout
• An exact branch-and-bound procedure for the quadratic-assignment problem
• An Algorithm for the Quadratic Assignment Problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

This page was built for publication: Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem