On the block layout shortest loop design problem

Amir Ahmadi-Javid and Nasrin Ramshe

IISE Transactions, 2013, vol. 45, issue 5, 494-501

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.

Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2012.693649 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:45:y:2013:i:5:p:494-501

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2012.693649

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().