Planning disassembly with deterministic yields


We will start by examining the disassemble-to-order problem under deterministic yield conditions, an assumption we will later relax. This chapter will familiarize the reader with both exact as well as heuristic solution methods, first for single period problems and later on considering problems with multiple time periods. Each section will further differentiate between problems with constrained returns and those where there is no limit to the amount of cores which can be obtained from the marketplace.


Planning Horizon Procurement Cost Winning Core Disposal Cost Discrete Uniform Distribution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Deutscher Universitäts-Verlag | GWV Fachverlage GmbH, Wiesbaden 2007

Personalised recommendations