IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v19y2025i1p45-67.html
   My bibliography  Save this article

Compact MILP models for double row layout problem with pairwise clearance

Author

Listed:
  • Richard Alaimo
  • Churlzu Lim

Abstract

Double row layout problem (DRLP) seeks for an optimal arrangement of departments along both sides of a central corridor to minimise the total material flow cost. This study considers a variant of DRLP where pairwise minimum clearance requirements between departments are enforced when they are assigned to the same side. This problem accounts for additional interaction that exists between departments during the layout planning process. Two mixed-integer linear programming formulations are proposed with the motivation that using fewer binary variables compared to the existing formulation in the literature helps reduce the solution time. Noting the NP-hardness of the problem, symmetry-breaking constraints are investigated in an effort to further alleviate the computational burden. The efficacy of the proposed models is demonstrated via a computational study using a set of test problem instances. [Received: 9 February 2022; Accepted: 11 August 2023]

Suggested Citation

  • Richard Alaimo & Churlzu Lim, 2025. "Compact MILP models for double row layout problem with pairwise clearance," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 19(1), pages 45-67.
    • Handle: RePEc:ids:eujine:v:19:y:2025:i:1:p:45-67
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=143080
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:eujine:v:19:y:2025:i:1:p:45-67. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.