An improved mixed-integer programming model for the double row layout of facilities

Abstract

We consider the double row layout problem, which is how to allocate a given number of machines at locations on either side of a corridor so that the total cost to transport materials among these machines is minimized. We propose modifications to a mixed-integer programming model in the literature, obtaining a tighter model. Further, we describe variants of the new model that are even tighter. Computational results show that the new model and its variants perform considerably better than the one in the literature, leading to both fewer enumeration tree nodes and smaller solution times.