Facility layout problem: Bibliometric and benchmarking analysis

Facility layout problem is related to the location of departments in a facility area, with the aim of determining the most effective configuration. Researches based on different approaches have been published in the last six decades and, to prove the effectiveness of the results obtained, several instances have been developed. This paper presents a general overview on the extant literature on facility layout problems in order to identify the main research trends and propose future research questions. Firstly, in order to give the reader an overview of the literature, a bibliometric analysis is presented. Then, a clusterization of the papers referred to the main instances reported in literature was carried out in order to create a database that can be a useful tool in the benchmarking procedure for researchers that would approach this kind of problems

A New MILP Approach for the Facility Layout Design Problem with Rectangular and L/T Shaped Departments

In this paper we propose a new approach for the facility layout problem (FLP) and suggest new mixed-integer linear programming (MILP) formulations. The proposed approach considers simultaneously the location of the departments within the facility and the internal arrangement of the machines. Two models are suggested, where the first addresses the rectangular department case and the second allows nonrectangular departments defined by an L/T shape. New regularity constraints are developed to avoid irregular department shapes

An Extended Double Row Layout Problem

The double row layout problem (DRLP) seeks to determine optimal machine locations on either side of an aisle, where the objective has been defined as the minimization of material ow cost among ma- chines while meeting machine clearance constraints. In this paper, we extend existing DRLP formulations in two respects. First, we consider the minimization of layout area besides the usual material ow cost objective. Second, we present a mixed integer linear programming formulation that permits non-zero aisle widths. This new formulation also includes new constraints that eliminate layout \mirroring, thus reducing the solution space significantly and thus solution times. Although small-scale problems may be solved optimally by commercial integer programming solvers, solution times are highly sensitive to the number of machines in a layout. A tabu search heuristic is shown to work well for moderately-sized problems. Numerical examples demonstrating the impact of both ow and area objectives, as well as aisle widths, are included

Beating the SDP bound for the floor layout problem: A simple combinatorial idea

For many mixed-integer programming (MIP) problems, high-quality dual bounds can be obtained either through advanced formulation techniques coupled with a state-of-the-art MIP solver, or through semi-definite programming (SDP) relaxation hierarchies. In this paper, we introduce an alternative bounding approach that exploits the ‘combinatorial implosion’ effect by solving portions of the original problem and aggregating this information to obtain a global dual bound. We apply this technique to the one-dimensional and two-dimensional floor layout problems and compare it with the bounds generated by both state-of-the-art MIP solvers and by SDP relaxations. Specifically, we prove that the bounds obtained through the proposed technique are at least as good as those obtained through SDP relaxations, and present computational results that these bounds can be significantly stronger and easier to compute than these alternative strategies, particularly for very difficult problem instances.United States. National Science Foundation. Graduate Research Fellowship Program (Grant 1122374)United States. National Science Foundation. Graduate Research Fellowship Program (Grant CMMI-1351619

Integrating Block Layout Design and Location of Input and Output Points in Facility Layout Problems

A well designed facility layout consists of an adequate arrangement of departments and an efficient material handling system that minimizes the total material handling cost between departments. Block layout design and input and output (I/O) points location are the two major decisions in that need to be made when designing the layout of a facility. Although both decisions are interrelated, the classical approach to facility layout design is to consider them independently. In this thesis, an integrated approach to design the block layout and to locate the I/O points is presented. In particular, we consider three different cases: (i) block layout design with fixed I/O points, (ii) block layout design with flexible I/O points, and (iii) block layout design with flexible department shapes and flexible I/O points. Four mixed integer programming (MIP) formulations are presented for these facility layout problems, with the objective of minimizing the total material handling cost. A case study of a manufacturing company is used to evaluate the performance of the proposed models. A comparison is performed between the existing and proposed layouts. These proposed layouts provide estimated savings of 50% and more as compared with the existing layout

Strong mixed-integer formulations for the floor layout problem

The floor layout problem (FLP) tasks a designer with positioning a collection of rectangular boxes on a fixed floor in such a way that minimizes total communication costs between the components. While several mixed integer programming (MIP) formulations for this problem have been developed, it remains extremely challenging from a computational perspective. This work takes a systematic approach to constructing MIP formulations and valid inequalities for the FLP that unifies and recovers all known formulations for it. In addition, the approach yields new formulations that can provide a significant computational advantage and can solve previously unsolved instances. While the construction approach focuses on the FLP, it also exemplifies generic formulation techniques that should prove useful for broader classes of problems.United States. National Science Foundation. Graduate Research Fellowship Program (Grant 1122374)United States. National Science Foundation. Graduate Research Fellowship Program (Grant CMMI-1351619