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

DOI10.1016/0377-2217(92)90048-EMaRDI QIDQ1197698zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 3073200 (Why is no real title available?)
• An Algorithm for the Quadratic Assignment Problem
• An exact algorithm for the general quadratic assignment problem
• An exact branch-and-bound procedure for the quadratic-assignment problem
• Contributions to the quadratic assignment problem
• Note—Comment on “The Dynamics of Plant Layout”
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Quadratic assignment problems
• The Dynamics of Plant Layout
• The facility layout problem
• The quadratic assignment problem

Cited in

(4)

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

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

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