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.
KeywordsPlanning Horizon Procurement Cost Winning Core Disposal Cost Discrete Uniform Distribution
Unable to display preview. Download preview PDF.