A variable neighbourhood search algorithm for disassembly lines. Issue 2 (2nd March 2015)

• Record Type: Journal Article
• Authors: Kalayci, Can B.; Polat, Olcay; Gupta, Surendra M.
• Editors: Sabry Shaaban, Dr; Abdul Salam Darwish, Dr
• Is Part Of: Journal of manufacturing technology management. Volume 26:Issue 2(2015)
• Page Start: 182
• Page End: 194
• Publication Date: 2015-03-02
• Subjects: Disassembly line balancing -- Sequence-dependent -- Disassembly -- Variable neighborhood search; Computer integrated manufacturing systems -- Periodicals; Manufacturing processes -- Automation -- Periodicals; Industrial engineering -- Periodicals; Manufacturing industries -- Management -- Periodicals; 670.5
• DOI: 10.1108/JMTM-11-2013-0168
• Languages: English
• ISSNs: 1741-038X

Abstract

Abstract : Purpose: – The purpose of this paper is to efficiently solve disassembly line balancing problem (DLBP) and the sequence-dependent disassembly line balancing problem (SDDLBP) which are both known to be NP-complete. Design/methodology/approach: – This manuscript utilizes a well-proven metaheuristics solution methodology, namely, variable neighborhood search (VNS), to address the problem. Findings: – DLBPs are analyzed using the numerical instances from the literature to show the efficiency of the proposed approach. The proposed algorithm showed superior performance compared to other techniques provided in the literature in terms of robustness to reach better solutions. Practical implications: – Since disassembly is the most critical step in end-of-life product treatment, every step toward improving disassembly line balancing brings us closer to cost savings and compelling practicality. Originality/value: – This paper is the first adaptation of VNS algorithm for solving DLBP and SDDLBP.