A facility layout problem decides the proper positions of a collection of departments to minimize total flow costs. Facility layout is not only limited to plant layout but also includes architectural space planning, manufacturing cell layout and VLSI design etc.
A dynamic layout problem generates a series of static layouts each representing the facility layout at a unique point in time. An existing dynamic layout algorithm uses branch and bound algorithm. Larger problems can not be solved due to number of integer variables. This thesis develops a more efficient branch and bound algorithm which reduces number of nodes searched, reduces memory required, and improves total cost where optimal solution is not reached.