Skip to main content

Planning disassembly with deterministic yields

  • Chapter
  • 446 Accesses

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints 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

Publish with us

Policies and ethics