.png){kind=icon}
返回
The double row layout problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207540802192126.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This research explores the double row layout problem (DRLP) that deals with how to place departments or machines on both sides of a central corridor. This type of layout problem is commonly observed in production and service facilities. Over the last 40 years, researchers have extensively studied a similar problem called the single row layout problem (SRLP) or one dimensional space allocation problem (ODSAP); as a result, several practical approaches are currently available for the problem. However, the DRLP has not received much attention in the literature although it often provides a better structure for layout designers. In this research, we first develop an MIP model for the DRLP that involves more variables and constraints than existing formulations of the SRLP. In turn, conditions yielding a good solution are analysed based on the proposed model. Five heuristic algorithms are developed to provide a reasonably good initial solution and corresponding upper bound of the DRLP. The performance of these heuristic algorithms, as well as MIP solutions by CPLEX 10.2, is compared in a series of experiments.
Keyword:
index terms
facility layout
double row layout problem
machine layout problem
heuristic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
<title>AIRS science processing system (ASPS): a description of architecture and capabilities</title>
PREAI
分享收藏
分享收藏
查看更多内容