Determining optimal disassembly and recovery strategies
We present a stochastic dynamic programming algorithm for determining the optimal disassembly and recovery strategy, given the disassembly tree, the process-dependent quality distributions of assemblies, and the quality-dependent recovery options and associated profits for assemblies. This algorithm generalizes the one proposed by Krikke et al. (International Journal of Production Research 1998; 36(1):111-39) in two ways. First, there can be multiple disassembly processes. Second, partial disassembly is allowed. Both generalizations are important for practise.
Year of publication: |
2006
|
---|---|
Authors: | Teunter, Ruud H. |
Published in: |
Omega. - Elsevier, ISSN 0305-0483. - Vol. 34.2006, 6, p. 533-537
|
Publisher: |
Elsevier |
Keywords: | Disassembly Recovery Profit maximization Dynamic programming |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Advance Selling and Advertising : A Newsvendor Framework
Wu, Meng, (2020)
-
The 'right' holding cost rates in average cost inventory models with reverse logistics
Teunter, Ruud H., (1998)
-
Economic ordering quantities for remanufacturable item inventory systems
Teunter, Ruud H., (1998)
- More ...