.png){kind=icon}
.png){kind=icon}
Return
A variable neighbourhood search algorithm for disassembly lines
.png){kind=icon}
PRE
AI
DOI：10.1108/JMTM-11-2013-0168.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Disassembly line balancing
Sequence-dependent
Disassembly
Variable neighborhood search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
711
Citations:
5.1K