Graph theoretic heuristics for unequal-sized facility layout problems

Omega

Volumn 23, Issue 4, 1995, Pages 391-401

  Kim, J Y ^a   Kim, Y D ^b  

^a Samsung Data Systems ^*  (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

facility layout; graph theory; heuristics; search procedure

Indexed keywords

EID: 0000936939     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0483(95)00016-H     Document Type: Article

References (34)

1. A modified procedure for converting a dual graph to a block layout
2. Computerized layout design: a branch and bound approach
3. Allocating facilities with CRAFT
4. DISCON a new method for the layout problem
5. An efficient heuristic for identifying a maximum weight planar subgraph
6. Modular allocation technique (MAT)
7. Facilities layout adjacency determination: an experimental comparison of three graph theoretic heuristics
8. A strategy for solving the plant layout problem
9. Graph theoretic heuristics for the plant layout problem
10. Drawing a block plan from a REL chart with graph theory and a microcomputer
11. A heuristic for facilities layout planning
12. On converting a dual graph into a block layout
13. Recent models and techniques for solving the layout problem
14. Machine layout problem in the flexible manufacturing systems
15. Efficient models for the facility layout problem
16. Quantitative tools for plant layout analysis
17. Quadratic assignment problem algorithms and the location of indivisible facilities
18. Efficient planarity testing
19. CLASS: computerized layout solution using simulated annealing
20. An algorithm for the quadratic assignment problem using Benders' decomposition
21. Facilities relative allocation technique (FRAT)
22. Assignment problems and the locations of economic activities
23. The facility layout problem
24. The quadratic assignment problem
25. CORELAP—computerized relationship layout planning
26. A new graph theoretic heuristic for facility layout
27. Solving quadratic assignment problems with rectilinear distance and integer programming
28. An experimental comparison of techniques for assignment of facilities to locations
29. A perturbation scheme to improve Hillier's solution to the facilities layout problem
30. P-complete approximation problem
31. A cluster-analytic approach to facility layout
32. Automated layout design program
33. Facilities planning with graph theory
34. An applied model for the facilities design problem