We consider the problem of determining the disassembly schedule (quantity and timing) of products in order to satisfy the demand of their parts or components over a finite planning horizon. This paper focuses on the capacitated version of the problem for the objective of minimizing the sum of setup, disassembly operation, and inventory holding costs. The problem is formulated as an integer program, and to solve the problem, a Lagrangean heuristic algorithm is developed after reformulating the integer program. To show the performance of the heuristic algorithm, computational experiments are done on randomly generated test problems, and the test results show that the algorithm suggested in this paper works well.
|Number of pages||11|
|Journal||Lecture Notes in Computer Science|
|State||Published - 2005|
|Event||International Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore|
Duration: 2005 May 9 → 2005 May 12