Skip to main content

Research Challenges in Supply Chain Planning with Flexible Demand

  • Chapter
Demand Flexibility in Supply Chain Planning

Part of the book series: SpringerBriefs in Optimization ((BRIEFSOPTI))

  • 1621 Accesses

Abstract

This chapter discusses the limitations of the models we have discussed throughout the book, and uses these limitations to characterize challenging future research directions. In doing so, we discuss the relation of the models we have considered to practice, and their potential for use in practical applications. We also consider the potential for expanding the definition of demand flexibility, as well as the technical difficulties inherent in meeting the challenges implied by potential future research avenues.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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

Institutional subscriptions

References

  1. Ağralı S, Geunes J (2009) A Single-Resource Allocation Problem with Poisson Resource Requirements. Optimization Letters 3:559–571

    Article  MathSciNet  MATH  Google Scholar 

  2. Balakrishnan A, Geunes J (2000) Requirements Planning with Substitutions: Exploiting Bill-of-Materials Flexibility in Production Planning. Manufacturing & Service Operations Management 2(2):166–185

    Article  Google Scholar 

  3. Barnhart C, Cohn A (1998) The Stochastic Knapsack Problem with Random Weights: A Heuristic Approach to Robust Transportation Planning. In: Proceedings of Tristan III, Puerto Rico, 17–23

    Google Scholar 

  4. Ervolina T, Ettl M, Lee Y, Peters D (2009) Managing Product Availability in an Assemble-to-Order Supply Chain with Multiple Customer Segments. OR Spectrum 31:257–280

    Article  MATH  Google Scholar 

  5. 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

    Article  MathSciNet  MATH  Google Scholar 

  6. Kleywegt A, Shapiro A, Homem-de-Mello T (2001) The sample average approximation method for stochastic discrete optimization. SIAM Journal of Optimization 12(2):479–502

    Article  MathSciNet  MATH  Google Scholar 

  7. Lee C, Çetinkaya S, Wagelmans A (2001) A Dynamic Lot Sizing Model with Demand Time Windows. Management Science 47(10):1384–1395

    MATH  Google Scholar 

  8. Levi R, Roundy R, Shmoys D, Sviridenko M (2008) A Constant Approximation Algorithm for the One-Warehouse Multi-Retailer Problem. Management Science 54:763–776

    Article  MATH  Google Scholar 

  9. Merzifonluoğlu Y, Geunes J (2006) Uncapacitated Production and Location Planning Models with Demand Fulfillment Flexibility. International Journal of Production Economics 102:199–216

    Article  Google Scholar 

  10. MerzifonluoÄŸlu Y, Geunes J, Romeijn H (2011) The Static Stochastic Knapsack Problem with Normally Distributed Item Sizes. Mathematical Programming, Series A (forthcoming)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Joseph Geunes

About this chapter

Cite this chapter

Geunes, J. (2012). Research Challenges in Supply Chain Planning with Flexible Demand. In: Demand Flexibility in Supply Chain Planning. SpringerBriefs in Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-9347-2_9

Download citation

Publish with us

Policies and ethics