Loading...
Search for:
block-layout
0.01 seconds
A practical exact algorithm for the shortest loop design problem in a block layout
, Article International Journal of Production Research ; Volume 43, Issue 9 , 2005 , Pages 1879-1887 ; 00207543 (ISSN) ; Laporte, G ; Sharifyazdi, M ; Sharif University of Technology
2005
Abstract
The problem of determining a shortest loop incident to each cell of a block layout is considered. A compact formulation is developed for this problem and a relatively simple algorithm is presented. It is shown that instances containing up to 60 cells can be solved optimally by using a commercial integer linear programming solver embedded within an iterative scheme. © 2005 Taylor & Francis Group Ltd
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) ; 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