Computational aspects of the facility layout design problem
β Scribed by Louis Caccetta; Yaya S. Kusumah
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 491 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper focuses on constructive graph theoretic based heuristics. We consider the facility layout problem where the objective is to maximize benefit. We briefly review the literature heuristics and present a new algorithm. Computational results, based on 600 randomly uniform generated problems, demonstrate good support for our new algorithm. We also present the performance of each algorithm when various initial solutions are applied.
π SIMILAR VOLUMES
## a b s t r a c t We present an efficient iterative heuristic procedure for solving the integrated layout design and product flow assignment problem. The layout design decisions involve planar location of unequal-area machines with duplicates. The product flows are assigned to machines according t