Skip to main content

2012 | OriginalPaper | Buchkapitel

9. Research Challenges in Supply Chain Planning with Flexible Demand

verfasst von : Joseph Geunes

Erschienen in: Demand Flexibility in Supply Chain Planning

Verlag: Springer New York

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Ağralı S, Geunes J (2009) A Single-Resource Allocation Problem with Poisson Resource Requirements. Optimization Letters 3:559–571 MathSciNetMATHCrossRef Ağralı S, Geunes J (2009) A Single-Resource Allocation Problem with Poisson Resource Requirements. Optimization Letters 3:559–571 MathSciNetMATHCrossRef
2.
Zurück zum Zitat 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 CrossRef 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 CrossRef
3.
Zurück zum Zitat 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 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
4.
Zurück zum Zitat 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 MATHCrossRef 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 MATHCrossRef
5.
Zurück zum Zitat 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 MathSciNetMATHCrossRef 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 MathSciNetMATHCrossRef
6.
Zurück zum Zitat 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 MathSciNetMATHCrossRef 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 MathSciNetMATHCrossRef
7.
Zurück zum Zitat Lee C, Çetinkaya S, Wagelmans A (2001) A Dynamic Lot Sizing Model with Demand Time Windows. Management Science 47(10):1384–1395 MATH Lee C, Çetinkaya S, Wagelmans A (2001) A Dynamic Lot Sizing Model with Demand Time Windows. Management Science 47(10):1384–1395 MATH
8.
Zurück zum Zitat 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 MATHCrossRef 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 MATHCrossRef
9.
Zurück zum Zitat Merzifonluoğlu Y, Geunes J (2006) Uncapacitated Production and Location Planning Models with Demand Fulfillment Flexibility. International Journal of Production Economics 102:199–216 CrossRef Merzifonluoğlu Y, Geunes J (2006) Uncapacitated Production and Location Planning Models with Demand Fulfillment Flexibility. International Journal of Production Economics 102:199–216 CrossRef
10.
Zurück zum Zitat Merzifonluoğlu Y, Geunes J, Romeijn H (2011) The Static Stochastic Knapsack Problem with Normally Distributed Item Sizes. Mathematical Programming, Series A (forthcoming) Merzifonluoğlu Y, Geunes J, Romeijn H (2011) The Static Stochastic Knapsack Problem with Normally Distributed Item Sizes. Mathematical Programming, Series A (forthcoming)
Metadaten
Titel
Research Challenges in Supply Chain Planning with Flexible Demand
verfasst von
Joseph Geunes
Copyright-Jahr
2012
Verlag
Springer New York
DOI
https://doi.org/10.1007/978-1-4419-9347-2_9

Premium Partner