Determining optimal disassembly and recovery strategies

Ruud H. Teunter

Omega, 2006, vol. 34, issue 6, 533-537

Abstract: 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.

Keywords: Disassembly; Recovery; Profit; maximization; Dynamic; programming (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305-0483(05)00021-6
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:34:y:2006:i:6:p:533-537

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().