Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A variable neighbourhood search algorithm for disassembly lines

A variable neighbourhood search algorithm for disassembly lines 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Manufacturing Technology Management Emerald Publishing

A variable neighbourhood search algorithm for disassembly lines

Loading next page...
 
/lp/emerald-publishing/a-variable-neighbourhood-search-algorithm-for-disassembly-lines-H9ELQVz0FA
Publisher
Emerald Publishing
Copyright
Copyright © Emerald Group Publishing Limited
ISSN
1741-038X
DOI
10.1108/JMTM-11-2013-0168
Publisher site
See Article on Publisher Site

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.

Journal

Journal of Manufacturing Technology ManagementEmerald Publishing

Published: Mar 2, 2015

There are no references for this article.