Disassembly sequencing with imprecise data: A case study

This paper deals with the problem of determining the disassembly level and the corresponding disassembly sequence for a product considering interval profit values in the objective function. To obtain a robust solution for the problem, we suggest a minimax regret solution approach in which the max regret of each candidate solution is calculated by comparing it with a set of reference solutions. The solution algorithm suggested in this paper includes a branch and bound search method to generate the sets of candidate and reference solutions and a dominance condition to reduce the comparison times. An application of the proposed algorithm is done for a case study on a subassembly of an end-of-life photocopier, and the results are reported.