A HEURISTIC APPROACH FOR DISASSEMBLE-TO-ORDER PROBLEM UNDER BINOMIAL YIELDS

摘要

In disassemble-to-order (DTO) systems randomness of recoverable parts gained from used products creates a major challenge for appropriate planning. Typically, it is assumed that yields from disassembly are either stochastically proportional (SP) or follow a binomial (BI) process. In the case of yield misspecification, it can be shown that the BI yield assumption usually results in a lower penalty than the SP yield assumption. For BI yield, however, a suitable, powerful heuristic is needed in order to facilitate DTO problem solving for complex real-world product structures. We present a heuristic approach that is based on a decomposition procedure for the underlying non-linear stochastic optimization problem and that can be applied to problems of arbitrary size. A numerical performance study reveals that this heuristic yields close-to-optimal results.