Abstract
Stochastic yields from disassembly complicate the planning of so-called disassemble to order problems, where a specified amount of components must be harvested from various models of returned products. Chance constraint programming, a branch of stochastic programming, has proven useful in several applications of operations management. This contribution will first formulate a novel chance constrained programming model for the single-period disassemble-to-order problem. We will then illustrate its application using an example, and highlight the tradeoff between service and costs which emerges. We also suggest a variety of extensions to the basic model, many of which will likely prove to be trivial and relevant to industry.
Keywords
- Stochastic Programming
- Chance Constraint
- Chance Constrain Program
- Closed Loop Supply Chain
- Closed Loop Supply
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.
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.
References
de Brito MP, Dekker R (2004) A framework for reverse logistics. In: Dekker R, Fleischmann M, Inderfurth K, van Wassenhove LN (eds) Quantitative Approaches to Reverse Logistics. Springer, Berlin
Inderfurth K, Langella IM (2006) Heuristics for solving disassemble-to-order problems with stochastic yields. OR Spectrum 28:73–99
Sen S, Hingle JL (1999) An introductory tutorial on stochastic linear programming. Interfaces 29:33–61
Charnes A, Cooper WW (1959) Chance constrained programming. Management Science 6:73–79
Taha HA (2003) Operations research: an introduction. Seventh Edition. Prentice Hall, Upper Saddle River.
Prekopa A (1995) Stochastic programming. Kluwer, Dordrecht.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Langella, I.M., Kleber, R. (2007). The Use of Chance Constrained Programming for Disassemble-to-Order Problems with Stochastic Yields. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_75
Download citation
DOI: https://doi.org/10.1007/978-3-540-69995-8_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69994-1
Online ISBN: 978-3-540-69995-8
eBook Packages: Business and EconomicsBusiness and Management (R0)