.png){kind=icon}
Return
Preprocessing for static and dynamic facility layout problems
.png){kind=icon}
PRE
AI
DOI：10.1080/002075497195560.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Most facility layout problems have departments with unequal areas and have significant rearrangement costs. This paper describes a model and improved algorithm which simultaneously handles these parameters. An existing algorithm solves the dynamic facilities layout problem while permitting the departments to have unequal areas. One part of the algorithm solves a mixed integer programming problem to find the desired block diagram layout. This large, complex problem could only be solved optimally for small problems. Therefore a preprocessing method was developed to prespecify certain obvious department pair orientations, which had previously required binary variables. The method uses estimated location, department sizes, and how costs to determine the probable variable values. Then, a revised branch and bound strategy solves for the less obvious department pair orientations. Test results show a significant cost reduction on a variety of previously published problems, and feasible solutions to previously unsolved problems. The algorithm found a layout solution to the standard CRAFT problem which has 10.5% lower costs than the previously best published layout.
Keywords:
MANUFACTURING SYSTEMS
DESIGN
ALGORITHMS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
No organization information available
Cited Papers
No cited papers available