Mathematical model and solution algorithms for selective disassembly sequencing with multiple target components and sequence-dependent setups

Abstract

This study considers the selective disassembly sequencing problem that determines the sequence of disassembly operations to obtain multiple target components of a used/end-of-life product for the purpose of repair, reuse, remanufacturing, disposal, etc. The problem is defined under the serial disassembly environment in which only one component is obtained at each disassembly operation. In particular, we consider sequence-dependent setup costs in which setup costs depend on the disassembly operation just completed and on the disassembly operation to be processed. The problem is represented as a disassembly precedence graph and a new integer programming model is suggested for the objective of minimizing the total disassembly cost. After we show that the problem is NP-hard, we suggest two types of heuristics: (a) branch and fathoming heuristic for small to medium sized instances; and (b) priority based heuristic for large-sized instances. A series of computational experiments were done on the effectiveness of the integer programming model and the performances of the two types of heuristics and the results are reported. In particular, to show the applicability of the mathematical model and the solution algorithms, a case study is reported on an end-of-life electronic calculator.