A network-based shortest route model for parallel disassembly line balancing problem

Seda Hezer and Yakup Kara

International Journal of Production Research, 2015, vol. 53, issue 6, 1849-1865

Abstract: Disassembly lines should be balanced efficiently to increase productivity of the line and to reduce disassembly costs. This problem is called disassembly line balancing problem (DLBP). The objective of the DLBP is usually to find the minimum number of disassembly workstations required. This study introduces parallel DLBP (PDLBP) with single-product and proposes a network model based on the shortest route model (SRM) for solving PDLBP. The proposed model is illustrated via numerical examples. A comprehensive experiment is also conducted to evaluate problem-specific features of disassembly lines. To the best of our knowledge, this is the first study dealing with PDLBP. This paper will present a different point of view regarding DLBP.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2014.965348 (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:tprsxx:v:53:y:2015:i:6:p:1849-1865

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

DOI: 10.1080/00207543.2014.965348

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().