Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent

This paper surveys work done to date on the problem of laying out the facilities of some system in terms of specifying which activities are to be adjacent. Each pair of facilities has a closeness rating which represents the desirability that they are located adjacently. Ratings are usually proportional to the flow of goods or people between facilities. The aim of the layout analyst is to design a system so that the sum of the ratings of adjacent pairs is maximized as this represents travel saved. This paper formulates the layout problem and reviews exact and heuristic methods of solution. In the literature review special emphasis is placed on the newly-emerging graph-theoretic techniques which appear promising.

[1]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[2]  R. C. Lee,et al.  CORELAP: Computerized relationship layout planning , 1967 .

[3]  Charles E. Pfefferkorn,et al.  A heuristic problem solving design system for equipment or furniture layouts , 1975, Commun. ACM.

[4]  Andrew Whinston,et al.  An Algorithm for the Quadratic Assignment Problem , 1970 .

[5]  M. Bazaraa.  Computerized Layout Design: A Branch and Bound Approach , 1975 .

[6]  M. Los.  Comparison of Several Heuristic Algorithms to Solve Quadratic Assignment Problems of the Koopmans-Beckmann Type , 1977 .

[7]  William Grant Ireson.  Factory planning and plant layout , 1952 .

[8]  Frank Harary,et al.  Graph Theory , 2016 .

[9]  Allan S. Carrie,et al.  Graph theory and computer aided facilities design , 1978 .

[10]  Allan S. Carrie,et al.  Numerical taxonomy applied to group technology and plant layout , 1973 .

[11]  F. S. Hillier,et al.  Quantitative Tools for Plant Layout Analysis , 1963 .

[12]  Tarek M. Khalil,et al.  Facilities relative allocation technique (FRAT) , 1973 .

[13]  Elwood S. Buffa,et al.  The Facilities Layout Problem in Perspective , 1966 .

[14]  Jouko J. Seppänen,et al.  Facilities Planning with Graph Theory , 1970 .

[15]  R. H. Hollier,et al.  A REVIEW OF PLANT DESIGN TECHNIQUES , 1970 .

[16]  Richard Muther,et al.  Systematic Layout Planning , 1985 .

[17]  C. Carl Pegels.  PLANT LAYOUT AND DISCRETE OPTIMIZING , 1966 .

[18]  Abraham Warszawski,et al.  Optimizing the Location of Facilities on a Building Site , 1973 .

[19]  T. E. Block.  Note---A Note on “Comparison of Computer Algorithms and Visual Based Methods for Plant Layout” by M. Scriabin and R. C. Vergin , 1977 .

[20]  Thomas E. Vollmann,et al.  An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[21]  F. Hillier,et al.  Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities , 1966 .

[22]  B. Gillett,et al.  Modular Allocation Technique (MAT) , 1970 .

[23]  C. S. Parker,et al.  An Experimental Investigation of Some Heuristic Strategies for Component Placement , 1976 .

[24]  Larry P. Ritzman.  The Efficiency of Computer Algorithms for Plant Layout , 1972 .

[25]  G. Nemhauser,et al.  Integer Programming , 2020 .

[26]  James M. Moore,et al.  String processing algorithms for plant layout problems , 1975 .

[27]  G. G. Hitchings,et al.  An efficient heuristic procedure for solving the layout design problem , 1976 .

[28]  A. N. Elshafei,et al.  Hospital Layout as a Quadratic Assignment Problem , 1977 .

[29]  John R. Immer.  Layout planning techniques , 1950 .

[30]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[31]  Charles M. Eastman,et al.  Preliminary report on a system for general space planning , 1972, CACM.

[32]  L. D. Hopkins,et al.  Humans vs. Computer Algorithms for the Plant Layout Problem , 1980 .

[33]  J. W. Gavett,et al.  The Optimal Assignment of Facilities to Locations by Branch and Bound , 1966, Oper. Res..

[34]  D. Robinson,et al.  Graph theoretic heuristics for the plant layout problem , 1978 .

[35]  James M. Moore,et al.  Computer aided facilities design : An international survey , 1974 .

[36]  S. E. Z. Abdel Barr,et al.  An interactive approach to computer aided facility layout , 1980 .

[37]  Roger C. Vergin,et al.  Comparison of Computer Algorithms and Visual Based Methods for Plant Layout , 1975 .

[38]  Les R. Foulds,et al.  Construction properties of combinatorial deltahedra , 1979, Discret. Appl. Math..

[39]  Farrokh Neghabat,et al.  An Efficient Equipment-Layout Algorithm , 1974, Oper. Res..

[40]  James M. Moore.  Facilities design with graph theory and strings , 1976 .

[41]  S. Lane.  A structural characterization of planar combinatorial graphs , 1937 .

[42]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[43]  Richard Muther,et al.  Practical Plant Layout , 1956 .

[44]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[45]  T. E. Block.  Note---On the Complexity of Facilities Layout Problems , 1979 .

[46]  Elwood S. Buffa,et al.  A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities , 1963 .

[47]  Ruddell Reed,et al.  An applied model for the facilities design problem , 1976 .

[48]  Per Galle.  An algorithm for exhaustive generation of building floor plans , 1981, CACM.

[49]  L. R. Foulds,et al.  A Strategy for Solving the Plant Layout Problem , 1976 .