Sharif Digital Repository

The Facility Layout Problem (FLP) is the problem of locating each department in a long plant floor without any overlap between departments in order to minimize the material handling cost. The main purpose of this study is to show the effectiveness of a robust approach to solve FLP. In this study, it is assumed that the departments’ length and width are not predetermined. For modeling this kind of uncertainty, the size of each department is considered as a bounded variable and two new parameters are also introduced to implement a robust approach. Moreover, a new adaptive algorithm is designed to determine the robust layout with respect to the decision makers’ requirements. Furthermore, the... 

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  

Facility layout problem (FLP) is one of the classical and important problems in real-world problems in the field of industrial engineering where efficiency and effectiveness are very important factors. To have an effective and practical layout, the deterministic assumptions of data should be changed. In this study, it is assumed that we have dynamic and uncertain values for departments’ dimensions. Accordingly, each dimension changes in a predetermined interval. Due to this assumption, two new parameters are introduced which are called length and width deviation coefficients. According to these parameters, a definition for layout in uncertain environment is presented and a mixed integer... 

Facility layout problem is a well-known optimization problem which generally deals with the arrangement of the facilities required in an organization. This problem has received much attention during the past decades. However, the researchers have mainly focused on the case where a single floor is available. While, in the competitive world, it is clear that using multi-floor structure layouts are much more efficient and in some cases necessary due to the nature of the functions and activities performed in the firms. Hence, this issue has recently attracted much attention and is becoming increasingly popular. Nevertheless, the lack of a review study on this subject for directing the new... 

Multi-floor facility layout problem concerns the arrangement of departments on the different floors. In this paper, a new mathematical model is proposed for multi-floor layout with unequal department area. Maximising the number of useful adjacencies among departments is considered as the objective function. The adjacencies are divided into two major categories: horizontal and vertical adjacencies. The horizontal adjacency may be occurred between the departments assigned to same floors while the vertical can be happened between departments assigned to any consecutive floors. A minimum common boundary length (surface area) between any two horizontal (vertical) adjacent departments is... 

In this study a new version of adjacency, which provides a more flexible layout design, is proposed. In the proposed version, departments which are nonadjacent yet close to each other are considered to be adjacent with a smaller adjacency rating. It is shown that the proposed adjacency is a generalized version of the traditional adjacency. A mathematical programming model is developed for the proposed facility layout problem. To show the flexibility and efficacy of the proposed model, a computational study is conducted. The solution of an illustrative example as well as the solutions of several test problems, reveal flexibility and efficacy of the proposed model  

In this manuscript a new phenomenon of adjacency and closeness rating is proposed for constructing the optimal facility layout design. In the proposed approach, the closeness rating is applied to every pair of neighboring departments in a range of their attached point up to a predefined distance between them. Also, while in the traditional approach the closeness rating is applied for determining either the proximity or farness of two departments, the proposed approach considers both the degree of closeness as the economical purposes, and farness as the safety purposes concurrently. A mathematical model is proposed for constructing the optimal layout design. For evaluating the efficiency and... 

The general goal of the facility layout problem is to arrange a given number of facilities to minimize the total cost associated with the known or projected interactions between them. One of the special classes of the facility layout problem is the Single Row Facility Layout Problem (SRFLP), which consists of finding an optimal linear placement of rectangular facilities with varying dimensions on a straight line. This paper first presents and proves a theorem to find the optimal solution of a special case of SRFLP. The results obtained by this theorem prove to be very useful in reducing the computational efforts when a new algorithm based on tabu search for the SRFLP is proposed in this... 

Single floor facility layout problem (FLP) is related to finding the arrangement of a given number of departments within a facility; while in multi-floor FLP, the departments should be imbedded in some floors inside the facility. The significant influence of layout design on the effectiveness of any organization has turned FLP into an important issue. This paper presents a three- (two-) stage mathematical programming method to find competitive solutions for multi- (single-) floor problems. At the first stage, the departments are assigned to the floors through a mixed integer programming model (the single floor version does not require this stage). At the second stage, a nonlinear programming... 

Single-Row Facility Layout Problem (SRFLP) is a http://library.sharif.ir/web-manage/catalog/resource.do?method=edit&flowLastAction=view&id=447751special class of facilitylayout problems, consists of finding an optimal linear placement of rectangularfacilities with varying dimensions on a straight line. In this research, wefirst present a theorem to find the optimal solution of a special case of SRFLP.The results obtained by this theorem are very useful in reducing thecomputational efforts when, later on, a new algorithm based on tabu search ispresented for SRFLP. Computational results of the proposed algorithm onbenchmark problems show the efficiency of the algorithm compared to the...