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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
