Loading...
  1. Simple search
  2. Search result
Search for: area-requirement
0.01 seconds
Total 1 records

      Constructing a block layout by face area

      , Article International Journal of Advanced Manufacturing Technology ; Volume 54, Issue 5-8 , 2011 , Pages 801-809 ; 02683768 (ISSN) Jokar, M. R. A ; Sangchooli, A. S ; Sharif University of Technology
      2011
      Abstract
      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  
    Total 1 records