A review of graph theory application to the facilities layout problem

Omega

Volumn 15, Issue 4, 1987, Pages 291-300

  Hassan, Mohsen MD ^a   Hogg, Gary L ^b  

^a WESTERN KENTUCKY UNIVERSITY   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249036528     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0483(87)90017-X     Document Type: Article

References (27)

1. The layout problem in FMS
2. A computerized plant layout analysis and evaluation technique (PLANET)
3. A solution technique for placing digital integrated circuitry on printed circuit boards
4. Graph theory and computer aided facilities design
5. An efficient heuristic for identifying a maximum weight planar subgraph
6. A strategy for solving the plant layout problem
7. Graph theoretic heuristics for the plant layout problem
8. Techniques for facilities layout: deciding which pairs of activities should be adjacent
9. A graph theoretic heuristic for multi-floor building layout
10. A graph theoritic heuristic for minimizing total transport cost in facilities layout
11. Facilities layout adjacency determination: an experimental comparison of three graph theoretic heuristics
12. Drawing a block plan from a relationship chart with graph theory and a microcomputer
13. A heuristic for facilities layout planning
14. Evaluation of an application of graph theory to the layout problem
15. SHAPE: a construction algorithm for area placement evaluation
16. Computer aided plant layout
17. CORELAP—computerized relationship layout planning
18. Facilities layout—survey of solution procedures
19. Use of graphs to decide the optimum layout of buildings
20. Facilities design with graph theory and strings
21. The zone of compromise for evaluating layout arrangements
22. Computerized facility layout with graph theory
23. Design of cellular production systems—a graph theoretic approach
24. An automated layout design program
25. Facilities planning with graph theory
26. String processing algorithms for plant layout problems