Simulated Annealing Algorithm for Solving Sequence-Dependent Disassembly Line Balancing Problem

In this paper, we consider a sequence-dependent disassembly line balancing problem (SDDLBP) with multiple objectives that concerns with the assignment of disassembly tasks to a set of ordered disassembly workstations while satisfying the disassembly precedence constraints and optimizing the effectiveness of several measures considering sequence-dependent time increments among disassembly tasks. Due to the high complexity of the SDDLBP, there is currently no known way to optimally solve even moderately sized instances of the problem; therefore an efficient methodology based on the simulated annealing is proposed to solve the SDDLBP.