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

This paper evaluates the relative performance of lower-bound procedures for the dynamic facility layout problem. Variables expected to affect the performance of these procedures are identified and used to evaluate the performance of the bounds. A class of lower bounds is established for the dynamic facility layout problem based on static lower-bound methodologies. This class of bounds is much more computationally attractive than existing lower-bound methodologies; it is shown that in certain circumstances, little accuracy is lost.