Loading...

Constructing a block layout by face area

Jokar, M. R. A ; Sharif University of Technology | 2011

549 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s00170-010-2960-4
  3. Publisher: 2011
  4. Abstract:
  5. Solving the facility layout problems by graph theory consists of two stages. In the first stage, a planar graph that specifies desired adjacencies is obtained and in the second stage, a block layout is achieved from the planar graph. In this paper, we introduce face area as a new concept for constructing a block layout. Based on this idea, we present a new algorithm for constructing block layout from a maximal planar graph (MPG). This MPG must be generated from deltahedron heuristic. Constructed block layout by this algorithm satisfies all of adjacency and area requirements
  6. Keywords:
  7. Area requirement ; Block layout ; Face area ; Facility design ; Facility layout ; Facility layout problems ; Graph theoretic facility layout problem ; Planar graph ; Two stage ; Algorithms ; Graphic methods ; Plant layout ; Stages ; Graph theory
  8. Source: International Journal of Advanced Manufacturing Technology ; Volume 54, Issue 5-8 , 2011 , Pages 801-809 ; 02683768 (ISSN)
  9. URL: http://link.springer.com/article/10.1007%2Fs00170-010-2960-4