Balancing a sequence-dependent disassembly line using simulated annealing algorithm

Abstract

Disturbing increase in the use of virgin resources to produce new products has threatened the environment. Many countries have reacted to this situation through regulations which aim to eliminate negative impact of products on the environment shaping the concept of environmentally conscious manufacturing and product recovery (ECMPRO). The first crucial and the most time-consuming step of product recovery is disassembly. The best productivity rate is achieved via a disassembly line in an automated disassembly process. In this chapter, we consider a sequence-dependent disassembly line balancing problem (SDDLBP) with multiple objectives that is concerned 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 (SA) is proposed to solve the SDDLBP. Case scenarios are considered and comparisons with ant colony optimization (ACO), particle swarm optimization (PSO), river formation dynamics (RFD), and tabu search (TS) approaches are provided to demonstrate the superior functionality of the proposed algorithm.

Citation

Kalayci, C.B. and Gupta, S.M. (2013), "Balancing a sequence-dependent disassembly line using simulated annealing algorithm", Applications of Management Science (Applications of Management Science, Vol. 16), Emerald Group Publishing Limited, Leeds, pp. 81-103. https://doi.org/10.1108/S0276-8976(2013)0000016008