Methods for optimum and near optimum disassembly sequencing

Abstract

This paper considers disassembly sequencing problems subjected to sequence dependent disassembly costs. In practice, the methods for dealing with such problems rely mainly on metaheuristic and heuristic methods, which intrinsically generate suboptimum solutions. Exact methods are NP-hard and therefore unsuitable to most of the practical problems. Nevertheless, it is useful to have exact methods available that can be applied in order to check, at least medium sized problems, to what extent the heuristically obtained solutions deviate from the optimum solution. The existing exact approaches, which are based on integer linear programming (ILP), become unmanageable, even for the cases of modest product complexity. To alleviate this problem to some extent, the iterative method that has been proposed by Lambert (2006) is applied here. This method is based on repeatedly solving a binary integer linear programming (BILP) problem instead of an ILP problem. The method appears to converge sufficiently quickly to be valuable for dealing with medium sized problems. We then use the iterative method for the validation of a new heuristic method that is also proposed in this paper. Finally, both the heuristic and the iterative BILP methods are implemented on a cellphone from practice consisting of 25 components that are represented, according to a set of precedence relationships, via a disassembly precedence graph.