A MODIFIED PROCEDURE FOR CONVERTING A DUAL GRAPH TO A BLOCK LAYOUT

被引:13
作者
ALHAKIM, LA
机构
[1] Department of Mechanical Engineering, Monash University, Melbourne, VA, 3 145, PO Box 197, Caulfield East
关键词
D O I
10.1080/00207549208948167
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The main difficulty associated with the application of graph theory to facilities layout is the conversion of the dual graph into a block layout. Hassan and Hogg (1989) presented a procedure to solve this problem. This paper gives some comments and critiques related to the problem and demonstrates that their procedure does not always work in a manner consistent with the adjacencies specified by the dual graph. In addition, rules for improving the procedure are developed. The paper is written in note format and the reader needs to refer to Hassan and Hogg (1989) for understanding the procedure and undefined notations.
引用
收藏
页码:2467 / 2476
页数:10
相关论文
共 5 条
[1]  
Al-Hakim L.A., Graph Theory Aided Facilities Planning, (1983)
[2]  
Green R.H., Al-Hakim L.A., A heuristic for facilities layout planning, Omega, 13, pp. 469-474, (1985)
[3]  
Giffin J.W., Foulds L.R., Cameron D.C., Drawing a block plan from a relationship chart with graph theory and microcomputer, Computers and Industrial Engineering, 10, pp. 109-116, (1986)
[4]  
Hassan M., Hogg G.L., On constructing a block layout by graph theory, International Journal of Production Research, 29, pp. 1263-1278, (1991)
[5]  
Hassan M., Hogg G.L., On converting a dual graph into a block layout, International Journal of Production Research, 27, pp. 1149-1160, (1989)