Algorithms for robust single and multiple period layout planning for manufacturing systems

Abstract In many layout design situations, the use of ‘optimality’ with respect to a design objective, such as the minimization of the material handling cost, is insufficiently discriminating. Robustness of the layout, in cases of demand uncertainty, is more important for the manufacturing manager. A robust layout is one that is close to the optimal solution for a wide variety of demand scenarios even though it may not be optimal under any specific demand scenario. In this paper, we develop algorithms to generate robust layout designs for manufacturing systems. Our robustness approach to the layout decision making can be applied to single and multiple period problems in the presence of considerable uncertainty, both in terms of products to be produced as well as their production volumes. Our algorithms, executed in a heuristic fashion, can be effectively used for layout design of large size manufacturing systems.

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

[2]  J. Rosenhead,et al.  Robustness and Optimality as Criteria for Strategic Decisions , 1972 .

[3]  Hau L. Lee,et al.  A ROBUSTNESS APPROACH TO FACILITIES DESIGN , 1987 .

[4]  P. Gilmore Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[5]  R. Burkard,et al.  Assignment and Matching Problems: Solution Methods with FORTRAN-Programs , 1980 .

[6]  Panagiotis Kouvelis,et al.  Single and multiple period layout models for automated manufacturing systems , 1991 .

[7]  W. E. Wilhelm,et al.  A Perturbation Scheme to Improve Hillier's Solution to the Facilities Layout Problem , 1984 .

[8]  Dennis B. Webster,et al.  Measuring flexibility of job-shop layouts , 1980 .

[9]  Meir J. Rosenblatt,et al.  A heuristic algorithm for the quadratic assignment formulation to the plant layout problem , 1989 .

[10]  J. Rosenhead,et al.  Robustness in Sequential Investment Decisions , 1968 .

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

[12]  Emmanuel Thanassoulis,et al.  Applied data envelopment analysis , 1991 .

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

[14]  Meir J. Rosenblatt,et al.  The dynamics of plant layout , 1986 .

[15]  E. Lawler The Quadratic Assignment Problem , 1963 .

[16]  R. Burkard Quadratic Assignment Problems , 1984 .

[17]  Andrew Kusiak,et al.  Machine Layout Problem in Flexible Manufacturing Systems , 1988, Oper. Res..

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

[19]  Zvi Drezner,et al.  DISCON: A New Method for the Layout Problem , 1980, Oper. Res..

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