Skip to main content
SpringerLink
Log in

Solution procedures for the dynamic facility layout problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P. Afentakis, R.A. Millen and M.M. Solomon, Dynamic layout strategies for flexible manufacturing systems, International Journal of Production Research 28(1990)311 - 323.

    Google Scholar 

  2. J. Balakrishnan, Notes: ‘The dynamics of plant layout’, Management Science 39(1993)654 - 655.

    Google Scholar 

  3. J. Balakrishnan, F.R. Jacobs and M.A. Venkataramanan, Solutions for the constrained dynamic facility layout problem, European Journal of Operational Research 57(1992)280 - 286.

    Google Scholar 

  4. R. Batta, Comment on ‘The dynamics of plant layout’, Management Science 33(1987)1065.

    Google Scholar 

  5. S.A. Broughton and V. Charumongkol, Mean and standard deviation of the layout cost distribution in facilities design problems, Mathematics Research Report No. 89-19, Cleveland State University, 1989.

  6. E.S. Buffa, Sequence analysis for functional layouts, Journal of Industrial Engineering 6(1955)12-13, 25.

    Google Scholar 

  7. R.E. Burkard, Quadratic assignment problems, European Journal of Operational Research 15(1984) 283 - 289.

    Google Scholar 

  8. R.E. Burkard and U. Derigs, Assignment and Matching Problems: Solution Methods with FORTRANPrograms, Springer, Berlin, 1980.

    Google Scholar 

  9. D.G. Conway and M.A. Venkataramanan, Genetic search and the dynamic facility layout problem, Computers and Operations Research 21(1994)955 - 960.

    Google Scholar 

  10. CPLEX Optimization, Inc., Using the CPLEX Linear Optimizer, Incline Village, NV, 1994.

  11. T.A. Feo and M.G.C. Resende, Greedy randomized adaptive search procedures, Journal of Global Optimization 6(1995)109 - 133.

    Google Scholar 

  12. P.E. Hicks and T.E. Cowan, CRAFT-M for layout rearrangement, Industrial Engineering 8(1976) 30 - 35.

    Google Scholar 

  13. B.K. Kaku and J.B. Mazzola, A tabu-search heuristic for the dynamic plant layout problem, presented at the National Meeting of the Institute for Operations Research and Management Sciences, New Orleans, 1995.

  14. P. Kouvelis and A.S. Kiran, Single and multiple period layout models for automated manufacturing systems, European Journal of Operational Research 52(1991)300 - 314.

    Google Scholar 

  15. P. Kouvelis, A.A. Kurawarwala and G.J. Gutiérrez, Algorithms for robust single and multiple period layout planning for manufacturing systems, European Journal of Operational Research 63 (1992)287 - 303.

    Google Scholar 

  16. T.A. Lacksonen, Static and dynamic layout problems with varying areas, Journal of the Operational Research Society 45(1994)59 - 69.

    Google Scholar 

  17. T.A. Lacksonen and E.E. Enscore, Quadratic assignment algorithms for the dynamic layout problem, International Journal of Production Research 31(1993) 503 - 517.

    Google Scholar 

  18. Y. Li, P.M. Pardalos and M.G.C. Resende, A greedy randomized adaptive search procedure for the quadratic assignment problem, in: Quadratic Assignment and Related Problems, Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, P.M. Pardalos and H. Wolkowicz, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, 1994, pp. 237 - 261.

  19. B. Malakooti, Multiple objective facility layout: A heuristic to generate efficient alternatives, International Journal of Production Research 27(1989)1225 - 1238.

    Google Scholar 

  20. B. Montreuil and A. Laforge, Dynamic layout design given a scenario tree of probable futures, European Journal of Operational Research 63(1992)271 - 286.

    Google Scholar 

  21. B. Montreuil and U. Venkatadri, Strategic interpolative design of dynamic manufacturing systems layouts, Management Science 37(1991)682 - 694.

    Google Scholar 

  22. R. Muther, Systematic Layout Planning, Industrial Education Institute, Boston, 1961.

    Google Scholar 

  23. P.M. Pardalos, F. Rendl and H. Wolkowicz, The quadratic assignment problem: A survey and recent developments, in: Quadratic Assignment and Related Problems, Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, P.M. Pardalos and H. Wolkowicz, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, 1994, pp. 1 - 42.

  24. M.G.C. Resende, P.M. Pardalos and Y. Li, Algorithm 754: FORTRAN subroutines for approximate solution of dense quadratic assignment problems using GRASP, ACM Transactions on Mathematical Software 22(1996)104 - 118.

    Google Scholar 

  25. M.J. Rosenblatt, The dynamics of plant layout, Management Science 32(1986)76- 86.

    Google Scholar 

  26. M.J. Rosenblatt and Z. Sinuany-Stern, A discrete efficient frontier approach to the plant layout problem, Material Flow 3(1986)277 - 281.

    Google Scholar 

  27. S. Sahni and T. Gonzalez, P-complete approximation problems, Journal of the Association for Computing Machinery 23(1976)555 - 565.

    Google Scholar 

  28. K.L. Slepicka and D.E. Rajchel, Layout selection over a finite time period, in: 1982 Annual Industrial Engineering Conference Proceedings, 1982, pp. 488 - 494.

  29. T.L. Urban, A heuristic for the dynamic facility layout problem, IIE Transactions 25(1993)57 - 63.

    Google Scholar 

  30. T.L. Urban, Computational performance and efficiency of lower bound procedures for the dynamic facility layout problem, European Journal of Operational Research 57(1992)271-279.

    Google Scholar 

  31. T.L. Urban, An improved upper bound for the dynamic facility layout problem, presented at the Joint National Meeting of the Operations Research Society of America and The Institute of Management Sciences, New York, 1989.

  32. G.O. Wesolowsky, Dynamic facility location, Management Science 19(1973)1241 - 1248.

    Google Scholar 

Download references

Authors
  1. Timothy L. Urban
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Urban, T.L. Solution procedures for the dynamic facility layout problem. Annals of Operations Research 76, 323–342 (1998). https://doi.org/10.1023/A:1018904806854

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018904806854

Search

Navigation