A Branch and Bound Algorithm for Parallel and Selective Disassembly Sequencing with Sequence-Dependent Setups

Abstract

This study considers selective disassembly sequencing to obtain one or more target components of an end-of-use/life product in parallel disassembly environment in which two or more components can be extracted at the same time by a single disassembly operation. The problem is to determine the sequence of disassembly operations while satisfying the precedence relationships among disassembly operations for the objective of minimizing the total disassembly operation cost. As a practical consideration, we consider the sequence-dependent setups in which setup costs depend on the disassembly operations just completed and on the next disassembly operations to be processed. To represent the problem mathematically, we propose an integer programming model after representing the disassembly sequences as an extended process graph. Then, a branch and bound algorithm is suggested that gives the optimal disassembly sequences to obtain one or more target components. To illustrate the algorithm, a simple case study is reported.