.png){kind=icon}
.png){kind=icon}
Return
Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2018.03.013.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper considers the facility layout problem (FLP) that places a set of fixed-size rectangular departments on a given rectangular site in such a way that the total material flow between adjacent departments is maximized. We demonstrate that an existing integer linear programming (ILP) model for this problem is flawed. Then, two novel ILP models are developed by reformulating some constraints of the existing model from different perspectives. They both significantly reduce the quantity of decision variables. It is also shown that the proposed models can be simplified if all departments have the same size. Numerical experiments conducted on several benchmark instances show that the proposed models outperform the existing one with promising results. Our models can solve all tested instances to optimality within reasonable time, while the existing one cannot. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Facility layout
Adjacency constraints
Integer linear programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W