Toward guiding the selection of a layout procedure

Purpose – The purpose of this paper is to assist facility designers decide when to use the graph‐theoretic (GTH) approach to develop a block layout and when to seek another alternative that requires a lesser effort. Difficulties encountered when a GTH block layout is developed from an adjacency graph could force designers to sacrifice or change some of the adjacencies of the adjacency graph in the GTH block layout. Consequently, the value of the objective function of a GTH block layout could become less than what would be expected from the GTH approach.Design/methodology/approach – A computational study is performed to assess the value of the objective function of block layouts produced by the GTH approach when adjacencies of the adjacency graph are deleted or changed in the GTH block layout and two of the procedures in the literature.Findings – The computational study reveals that the magnitude of the decline in the value of the objective function of the GTH block layout renders it comparable to values o...

[1]  Gary L. Hogg,et al.  A review of graph theory application to the facilities layout problem , 1987 .

[2]  G. Hogg,et al.  On converting a dual graph into a block layout , 1989 .

[3]  J. Leung.  A New Graph-Theoretic Heuristic for Facility Layout , 1992 .

[4]  James M. Moore.  The zone of compromise for evaluating lay-out arrangements , 1980 .

[5]  Mohsen M. D. Hassan.  Some observations on converting a dual graph into a block layout , 1992 .

[6]  H. D. Ratliff,et al.  GENERATING A LAYOUT FROM A DESIGN SKELETON , 1993 .

[7]  G. Hogg,et al.  On constructing a block layout by graph theory , 1991 .

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

[9]  Ibrahim H. Osman,et al.  A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problem , 2006, Comput. Oper. Res..

[10]  Dennis B. Webster,et al.  Evaluation of an application of graph theory to the layout problem , 1985 .

[11]  Mohsen M. D. Hassan,et al.  Toward re-engineering models and algorithms of facility layout , 2000 .

[12]  Ardavan Nozari,et al.  Computerized facility layout with graph theory , 1981 .

[13]  M. M. D. Hassan.  Discussion A note on ‘Similarity of a new greedy heuristic for facility layout by graph theory to an existing approach’ , 1994 .

[14]  Ibrahim H. Osman,et al.  A greedy random adaptive search procedure for the weighted maximal planar graph problem , 2003, Comput. Ind. Eng..

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

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

[17]  P. S. Welgama,et al.  Facilities layout: A knowledge-based approach for converting a dual graph into a block layout☆ , 1994 .