Disassembly of multiple product structures

In this paper, we address the problem of scheduling the disassembly of discrete parts products characterized by well-defined product structures. We allow for the existence of multiple product structures as well as the existence of common parts and/or materials which make the problem very complex. To this end, we present two companion algorithms which can be applied to obtain a disassembling scheme for such problems. Specifically, the algorithms determine the quantity and operations schedule of disassembly for all product structures (including the ordering of the roots and the disassembly schedule for the roots and the subassemblies) in order to fulfil the demand for the various parts. An example is presented to illustrate the use of the algorithms.