IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v57y2019i1p34-47.html
   My bibliography  Save this article

A mixed-integer programming formulation for the double row layout of machines in manufacturing systems

Author

Listed:
  • André R.S. Amaral

Abstract

The Double Row Layout Problem (DRLP) is the problem of allocating a given set of machines on both sides of a straight line corridor so as to minimise the total cost of transporting materials among machines. The DRLP occurs in several manufacturing plants, particularly in semiconductor manufacturing. While it has a large practical importance, the problem is very difficult to solve to optimality. In this paper, we construct a mixed-integer programming (MIP) formulation of the problem, which favourably compares to a previously published MIP formulation. The new model is found to present similar performance to another published MIP formulation, and it has the advantage of being more intuitive for handling qualitative inputs that may be required in a layout refinement phase.

Suggested Citation

  • André R.S. Amaral, 2019. "A mixed-integer programming formulation for the double row layout of machines in manufacturing systems," International Journal of Production Research, Taylor & Francis Journals, vol. 57(1), pages 34-47, January.
    • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:1:p:34-47
    DOI: 10.1080/00207543.2018.1457811
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2018.1457811
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2018.1457811?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank, 2020. "Decorous combinatorial lower bounds for row layout problems," European Journal of Operational Research, Elsevier, vol. 286(3), pages 929-944.
    2. Dahlbeck, Mirko, 2021. "A mixed-integer linear programming approach for the T-row and the multi-bay facility layout problem," European Journal of Operational Research, Elsevier, vol. 295(2), pages 443-462.
    3. Xing Wan & Xing-Quan Zuo & Xin-Chao Zhao, 2021. "A Surrogate Model-Based Hybrid Approach for Stochastic Robust Double Row Layout Problem," Mathematics, MDPI, vol. 9(15), pages 1-18, July.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:57:y:2019:i:1:p:34-47. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.