Determining optimal disassembly and recovery strategies
Determining optimal disassembly and recovery strategies
复制标题
DOI：
10.1016/j.omega.2005.01.014
复制
发表时间：
2004-03
期刊：
影响因子：
--
通讯作者：
R. Teunter
中科院分区：
文献类型：
--
作者：
R. Teunter
在给定拆卸树、装配质量依赖分布、装配质量依赖回收选项和相关利润的情况下，提出了一种确定最优拆卸和回收策略的随机动态规划算法。该算法推广了Krikke等人提出的算法。(《国际生产研究杂志》1998；36(1)：111-39)。首先，可以有多个拆卸过程。其次，允许部分拆卸。这两个概括对练习都很重要。
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.