A variable neighbourhood search algorithm for disassembly lines

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.

Citation

Kalayci, C.B., Polat, O. and Gupta, S.M. (2015), "A variable neighbourhood search algorithm for disassembly lines", Journal of Manufacturing Technology Management, Vol. 26 No. 2, pp. 182-194. https://doi.org/10.1108/JMTM-11-2013-0168