Solution procedures for the dynamic facility layout problem

Timothy Urban

Annals of Operations Research, 1998, vol. 76, issue 0, 323-342

Abstract: Existing optimal solution procedures for the dynamic facility layout problem require the repeated solution of quadratic assignment problems within the framework of a dynamic program. The computational requirements for this problem necessitate the development of efficient algorithms for special cases of the problem and strong bounds for the general case of the problem. The concept of incomplete dynamic programming is applied to the dynamic facility layout problem to find the optimal solution to the problem with fixed rearrangement costs at exceptionally reduced solution times. Heuristics are also developed to provide a solution methodology for larger problems. A lower bound is developed for the general problem that dominates all existing bounds, and it is shown how the bound can be used as an initial test for optimality before the dynamic program is solved. Finally, the incomplete dynamic programming methodology is extended to find an upper bound for the general problem that dominates all previous bounds. Copyright Kluwer Academic Publishers 1998

Keywords: facility layout; dynamic models; combinatorial optimization; heuristics; bounding procedures (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018904806854 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:76:y:1998:i:0:p:323-342:10.1023/a:1018904806854

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018904806854

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().