Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Facilities layout

Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_326
In both manufacturing and service operations, the relative location of facilities is a critical decision affecting costs and efficiency of operations. The facility layout problem (FLP) deals with the design of layouts wherein a given number of discrete entities are to be located in a given space. The definitions of entities and spaces can vary considerably, making solution techniques applicable in a wide variety of settings, as can be seen from the examples given below.




Office building


Factory floor



Interdependent plants

Geographical market

Indicators and controls

Control panel


Electronic boards


Typewriter keyboard

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


  1. [1]
    Bazaraa, M.S. and Kirca, O. (1983). “A Branch-and-Bound-Based Heuristic for Solving the Quadratic Assignment Problem,” Naval Research Logistics Quarterly, 30, 287–304.Google Scholar
  2. [2]
    Bazaraa, M.S. and Sherali, H.D. (1980). “Bender's Partitioning Scheme Applied to a New Formulation of the Quadratic Assignment Problem,” Naval Research Logistics Quarterly, 27, 29–41.Google Scholar
  3. [3]
    Bozer, Y.A., Meller, R.D., and Erlebacher, S.J. (1994). “An Improvement-type Layout Algorithm for Single and Multiple-floor Facilities,” Management Science, 40, 918–932.Google Scholar
  4. [4]
    Burkard, R.E. and Bonniger, T. (1983). “A Heuristic for Quadratic Boolean Programs with Applications to Quadratic Assignment Problems,” European Jl. Operational Research, 13, 374–386.Google Scholar
  5. [5]
    Burkard, R.E. and Derigs, U. (1980). Assignment and Matching Problems: Solution Methods with Fortran Programs. Vol. 184 of Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin.Google Scholar
  6. [6]
    Connolly, D.T. (1990). “An Improved Annealing Scheme for the QAP,” European Jl. Operational Research, 46, 93–100.Google Scholar
  7. [7]
    Foulds, L.R. (1983). “Techniques for Facilities Layout: Deciding Which Pairs of Activities Should Be Adjacent,” Management Science, 29, 1414–1426.Google Scholar
  8. [8]
    Fu, M. and Kaku, B.K. (1997). “Minimizing Work-in-process and Material Handling in the Facilities Layout Problem,” IIE Transactions, 29, 29–36.Google Scholar
  9. [9]
    Gavett, J.W. and Plyter, N.V. (1966). “The Optimal Assignment of Facilities to Locations by Branch and Bound,” Operations Research, 14, 210–232.Google Scholar
  10. [10]
    Gilmore, P.C. (1962). “Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem,” Jl. of SIAM, 10, 305–313.Google Scholar
  11. [11]
    Graves, G.W. and Whinston, A.B. (1970). “An Algorithm for the Quadratic Assignment Problem,” Management Science, 17, 453–471.Google Scholar
  12. [12]
    Kaku, B.K., Thompson, G.L., and Morton, T.E. (1991). “A Hybrid Heuristic for the Facilities Layout Problem,” Computers & Operations Research, 18, 241–253.Google Scholar
  13. [13]
    Koopmans, T.C. and Beckmann, M. (1957). “Assignment Problems and the Location of Economic Activities,” Econometrica, 25, 53–76.Google Scholar
  14. [14]
    Kusiak, A. and Heragu, S.S. (1987). “The Facility Lay-out Problem,” European Jl. Operational Research, 29, 229–251.Google Scholar
  15. [15]
    Land, A.H. (1963). “A Problem of Assignment with Inter-related Costs,” Operational Research Quarterly, 14, 185–199.Google Scholar
  16. [16]
    Lawler, E.L. (1963). “The Quadratic Assignment Problem,” Management Science, 9, 586–599Google Scholar
  17. [17]
    Ligett, R.S. (1981). “The Quadratic Assignment Problem: An Experimental Evaluation Solution Strategies,” Management Science, 27, 442–458.Google Scholar
  18. [18]
    Skorin-Kapov, J. (1990). “Tabu Search Applied to the Quadratic Assignment Problem,” ORSA Jl. Computing, 2, 33–45.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.American UniversityWashingtonUSA