Parallel disassembly sequencing with sequence-dependent operation times

This paper focuses on the disassembly sequencing, which is the problem of determining the disassembly level and the corresponding disassembly sequence for a product at its end-of-life with the objective of maximizing the overall profit. Parallel disassembly and sequence-dependent operation times are considered by developing an extended process graph obtained from a transformation of a conventional AND/OR graph. Then, an integer programming formulation is developed with precedence constraints that allows its resolution with standard techniques. Finally, an optimal solution is obtained, with a reasonable amount of computation time, for an industrial application of a subassembly of a copy machine.