Disassembly scheduling is the problem of determining the timing and quantity of disassembling used products to satisfy the demands of their parts or components over the planning horizon. This paper focuses on the case of single product type without parts commonality while the resource capacity restrictions are explicitly considered. The problem is formulated as an integer program for the objective of minimizing the number of products to be disassembled, and an optimal algorithm, after deriving the properties of the problem, is suggested. Computational experiments are done on randomly generated test problems, and the results are reported.
|Number of pages||10|
|Journal||Lecture Notes in Computer Science|
|State||Published - 2005 Jan 1|
|Event||International Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore|
Duration: 2005 May 9 → 2005 May 12