Scheduling disassembly

Abstract

We present an algorithm for scheduling the disassembly of discrete parts products characterized by a well defined product structure. As opposed to MRP where the demand occurs at the end item level, the demand in the disassembly case is motivated by the component level of the product structure. Even though the objective in the disassembly case is the reverse of that of MRP, the algorithm itself is not the reverse of the MRP algorithm. It is considerably more complicated. An example is presented and its implementation in a spreadsheet is described.