Parallel disassembly sequencing with sequence-dependent operation times

This paper focuses on the disassembly sequencing, which is the problem of d etermining the disassembly level and the corresponding disassembly sequence for a product at its end-of-life with the objective of maximizing the over all profit. Parallel disassembly and sequence-dependent operation times are considered by developing an extended process graph obtained from a transfo rmation of a conventional AND/OR graph. Then, an integer programming formul ation is developed with precedence constraints that allows its resolution w ith standard techniques. Finally, an optimal solution is obtained, with a r easonable amount of computation time, for an industrial application of a su bassembly of a copy machine.