.png){kind=icon}
返回
An extended distance-based facility layout problem
.png){kind=icon}
PRE
AI
DOI：10.1080/0020754031000088138.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The distance-based facility layout problem with unequal-area departments has been studied by many researchers for over 30 years. Still, current approaches require certain assumptions that limit the type of solutions obtained. In this paper, we consider manufacturing systems in which replicates of the same machine type may exist in the facility, and propose an extended distance-based facility layout problem that concurrently determines the number and shape of the departments, the assignment of machines to departments, and the allocation of part flow volume to individual machines. A non-linear mixed-integer program that accurately captures the extended facility layout and part flow allocation problem, a decomposition approach that exploits the structure of the formulation using a heuristic solution procedure, as well as computational results that evaluate the proposed approach, are presented.
Keyword:
QUADRATIC ASSIGNMENT PROBLEM
CELL-FORMATION
GROUP TECHNOLOGY
DESIGN
METHODOLOGY
SIMULATION
ALGORITHM
OPTIMIZATION
ORGANIZATION
ENVIRONMENTS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
