IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v45y2013i5p494-501.html
   My bibliography  Save this article

On the block layout shortest loop design problem

Author

Listed:
  • Amir Ahmadi-Javid
  • Nasrin Ramshe

Abstract

This article verifies a formulation presented by Asef-Vaziri, Laporte, and Sriskandarajah (2000) for the block layout shortest loop design problem. An error in the set of connectivity constraints of the formulation is corrected and then it is shown that a new set of constraints is needed to guarantee that every solution satisfying the corrected formulation determines a complete loop; i.e., a loop covering each production cell of the block layout. Finally, a cutting-plane algorithm is developed to solve the corrected formulation. The proposed algorithm solves instances with sizes of up to 100 departments in less than 3 seconds. This shows that the algorithm outperforms the best algorithm proposed in the literature, which can solve instances with sizes of up to 80 in less than 60 seconds.

Suggested Citation

  • Amir Ahmadi-Javid & Nasrin Ramshe, 2013. "On the block layout shortest loop design problem," IISE Transactions, Taylor & Francis Journals, vol. 45(5), pages 494-501.
    • Handle: RePEc:taf:uiiexx:v:45:y:2013:i:5:p:494-501
    DOI: 10.1080/0740817X.2012.693649
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2012.693649
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2012.693649?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. Asef-Vaziri, Ardavan & Kazemi, Morteza, 2018. "Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout," European Journal of Operational Research, Elsevier, vol. 264(3), pages 1033-1044.
    2. Minhee Kim & Junjae Chae, 2019. "Monarch Butterfly Optimization for Facility Layout Design Based on a Single Loop Material Handling Path," Mathematics, MDPI, vol. 7(2), pages 1-21, February.
    3. Amir Ahmadi-Javid & Nasrin Ramshe, 2019. "Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm," 4OR, Springer, vol. 17(4), pages 373-400, December.

    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:uiiexx:v:45:y:2013:i:5:p:494-501. 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/uiie .

    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.