.png){kind=icon}
Return
A parallel ordering problem in facilities layout
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2013.07.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we study a problem that occurs in the row layout of facilities. Among n facilities, suppose that there are t facilities with some characteristic in common so that they should be arranged along one row, leaving the remainder (n-t) facilities to be arranged on a parallel row. The objective is to order the facilities in the two rows such that some cost function is minimized. This problem is called the parallel row ordering problem (PROP). The PROP is a generalization of the single row facility layout problem (SRFLP). Here, a mixed integer programming (MIP) formulation of the PROP is presented which extends a MIP formulation of the SRFLP. We show that a PROP with n facilities may be solved faster than a SRFLP with n facilities. Theoretical and experimental comparisons of the SRFLP and the PROP formulations are presented. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Combinatorial optimization
Integer programming
Single row facility layout problem
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
Organization
Cited Papers
Stability of Reference Genes for Messenger RNA Quantification by Real-Time PCR in Mouse Dextran Sodium Sulfate Experimental Colitis.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAIShareSaveShareSave
ShareSaveShareSaveShareSaveShareSaveShareSave
View more