A variable neighbourhood search algorithm for disassembly lines

Can B. Kalayci (Department of Industrial Engineering, Pamukkale University, Denizli, Turkey)
Olcay Polat (Department of Industrial Engineering, Pamukkale University, Denizli, Turkey)
Surendra M. Gupta (Department of Mechanical and Industrial Engineering, Northeastern University, Boston, MA, USA)

Journal of Manufacturing Technology Management

ISSN: 1741-038X

Publication date: 2 March 2015



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.


This manuscript utilizes a well-proven metaheuristics solution methodology, namely, variable neighborhood search (VNS), to address the problem.


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.


This paper is the first adaptation of VNS algorithm for solving DLBP and SDDLBP.



Kalayci, C., Polat, O. and Gupta, S. (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

Download as .RIS



Emerald Group Publishing Limited

Copyright © 2015, Emerald Group Publishing Limited

Please note you might not have access to this content

You may be able to access this content by login via Shibboleth, Open Athens or with your Emerald account.
If you would like to contact us about accessing this content, click the button and fill out the form.
To rent this content from Deepdyve, please click the button.