Computational aspects of the facility layout design problem

Nonlinear Analysis, Theory, Methods and Applications

Volumn 47, Issue 8, 2001, Pages 5599-5610

  Caccetta, Louis ^b   Kusumah, Yaya S ^b  

^a CURTIN UNIVERSITY   (Australia)

^b NONE

Author keywords

Facility layout; Heuristic; Maximal planar graphs

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; STRUCTURAL DESIGN;

FACILITY LAYOUT DESIGN PROBLEM;

COMPUTATIONAL COMPLEXITY;

EID: 0035421480     PISSN: 0362546X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0362-546X(01)00662-9     Document Type: Article

References (26)

1. A modified procedure for converting a dual graph to a block layout
2. A note 'On Tessa'
3. Computerized layout design: A branch and bound approach
4. On the use of exact and heuristic cutting plane methods for the quadratic assignment problem
5. Tessa-A new greedy heuristic for facilities layout planning
6. A reply to 'A note on "On Tessa"'
7. A reply to 'A note on "Similarity of a new greedy heuristic for facility layout by graph theory to an existing approach"'
8. A new heuristic algorithm for the facility layout design
9. An efficient heuristic for identifying a maximum Weight Planar Subgraph
10. A strategy for solving the plant layout problem
11. Graph theoretic heuristic for the plant layout problem
12. Facilities layout adjacency determination: An experimental comparison of three graph theoretic heuristics
13. Drawing a block plan from a REL chart with graph theory and a microcomputer
14. A heuristic for facilities layout planning
15. On converting a dual graph into a block layout
16. On constructing a block layout by graph theory
17. A note on 'Similarity of a new greedy heuristic for facility layout by graph theory to an existing approach
18. A new approach to the block layout problem
19. Graph theoretic heuristic for unequal-sized facility layout problems
20. The facility layout problem (invited review)
21. The quadratic assignment problem
22. A new graph-theoretic heuristic for the facility layout
23. Orthogonal floor plan from maximal planar graphs
24. Complete approximation problems
25. On the worst case performance of Tessa