Abstract

In this paper, we consider the problem of determining the optimal number of returned products to disassemble to fulfill the demand for a specified number of parts. This is known as the disassembly-to-order (DTO) problem. The deterministic yield version of this problem has been addressed in the literature. Recently, the stochastic yield version of this problem with a single objective has also been reported in the literature. In this paper, we extend the methodology to include multiple objectives. To this end, we model the DTO problem using integer goal programming. The stochastic problem is solved by transforming it into its deterministic equivalent problem. This conversion is accomplished by considering the specific structures of the products with one core and one part (""one-to-one structure"") and apply it to handle the products with one core and multiple parts (""one-to-many structure""). For these special cases it is possible to solve the stochastic problem analytically so that valuable insights can be gained by comparing the stochastic and deterministic solutions. This will help us to determine effective deterministic yield equivalents. We present a case example to illustrate the methodology.

Keywords

Disassembly, goal programming, stochastic, yields, reuse, recycling

Subject Categories

Production engineering

Disciplines

Engineering

Publication Date

2004


View Full Text

Click button above to open, or right-click to save.

Included in

Engineering Commons

Share

COinS