Abstract
This chapter considers a seemingly innocuous change in the assumptions underlying the Demand Selection Problem (DSP) considered in the previous chapter, which severely complicates the problem analysis. Instead of a sequence of independent demands over a time horizon, in this variant of the problem, demands in successive periods may be related in the sense that if we satisfy a given demand in some period t, we must then satisfy a particular set of demands in other periods. That is, instead of selecting individual demands, we are now faced with the problem of selecting from a set of time-phased vectors of demands. In practical terms, this corresponds to determining whether we will satisfy all or none of a given customer’s or market’s demands over the time horizon. We refer to the resulting problem as the Market Selection Problem (MSP) and discuss the problem’s complexity and potential solution approaches throughout this chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Garey M, Johnson D (1979) Computers and Intractability. W.H. Freeman and Company, New York
Geunes J, Levi R, Romeijn H, Shmoys D (2011) Approximation Algorithms for Supply Chain Planning and Logistics Problems with Market Choice. Mathematical Programming, Series A 130(1):85–106
Hochbaum D (2004) Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today. Management Science 50(6):709–723
Levi R, Geunes J, Romeijn H, Shmoys D (2005) Inventory and Facility Location Models with Market Selection. Lecture Notes in Computer Science 3509(2005):237–259
Motwani R, Naor J, Raghavan P (1996) Randomized Approximation Algorithms in Combinatorial Optimization, in Approximation Algorithms for NP-hard Problems (Hochbaum D (ed.)) Thomson, Boston, 447–481
Raghavan P, Thompson C (1987) Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs. Combinatorica 7:365–374
Van den Heuvel W, Kundakcioglu E, Geunes J, Romeijn H, Sharkey T, Wagelmans A (2011) Integrated Market Selection and Production Planning: Complexity and Solution Approaches. Mathematical Programming, Series A (forthcoming)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Joseph Geunes
About this chapter
Cite this chapter
Geunes, J. (2012). Dynamic Lot Sizing with Market Selection. In: Demand Flexibility in Supply Chain Planning. SpringerBriefs in Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-9347-2_6
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9347-2_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-9346-5
Online ISBN: 978-1-4419-9347-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)