The purpose of this paper is to introduce sequence‐dependent disassembly line balancing problem (SDDLBP) to the literature and propose an efficient metaheuristic solution methodology to this NP‐complete problem.
This manuscript utilizes a well‐proven metaheuristics solution methodology, namely, ant colony optimization, to address the problem.
Since SDDLBP is NP‐complete, finding an optimal balance becomes computationally prohibitive due to exponential growth of the solution space with the increase in the number of parts. The proposed methodology is very fast, generates (near) optimal solutions, preserves precedence requirements and is easy to implement.
Since development of cost effective and profitable disassembly systems is an important issue in end‐of‐life product treatment, every step towards improving disassembly line balancing brings us closer to cost savings and compelling practicality.
This paper introduces a new problem (SDDLBP) and an efficient solution to the literature.
