Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2007 Deutscher Universitäts-Verlag | GWV Fachverlage GmbH, Wiesbaden
About this chapter
Cite this chapter
(2007). Planning disassembly with deterministic yields. In: Planning Demand-Driven Disassembly for Remanufacturing. DUV. https://doi.org/10.1007/978-3-8350-9595-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-8350-9595-3_3
Publisher Name: DUV
Print ISBN: 978-3-8350-0775-8
Online ISBN: 978-3-8350-9595-3
eBook Packages: Business and EconomicsBusiness and Management (R0)