Dynamic Capacity Allocation to Customers Who Remember Past Service

Published Online:https://doi.org/10.1287/mnsc.1120.1643

References

  • Adelman D, Mersereau AJ. Relaxations of weakly coupled stochastic dynamic programs. Oper. Res. (2008) 56(3):712–727LinkGoogle Scholar
  • Aflaki S, Popescu I. Managing retention in service relationships. (2012) . Working paper, INSEAD, SingaporeCrossrefGoogle Scholar
  • Bertsekas DP, Tsitsiklis JN. Neuro-Dynamic Programming (1996) (Athena Scientific, Belmont, MA) Google Scholar
  • Cachon GP, Lariviere MA. Capacity allocation using past sales: When to turn-and-earn. Management Sci. (1999) 45(5):685–703LinkGoogle Scholar
  • Cachon GP, Zhang F. Obtaining fast service in a queueing system via performance-based allocation of demand. Management Sci. (2007) 53(3):408–420LinkGoogle Scholar
  • Carr S, Lovejoy W. The inverse newsvendor problem: Choosing an optimal demand portfolio for capacitated resources. Management Sci. (2000) 46(7):912–927LinkGoogle Scholar
  • de Farias DP, Van Roy B. The linear programming approach to approximate dynamic programming. Oper. Res. (2003) 51(6):850–865LinkGoogle Scholar
  • Dube J-P, Hitsch GJ, Manchanda P. An empirical model of advertising dynamics. Quant. Market. Econom. (2005) 3(2):107–144CrossrefGoogle Scholar
  • Fader PS, Hardie BGS. Probability models for customer-base analysis. J. Interactive Marketing (2009) 23(1):61–69CrossrefGoogle Scholar
  • Federgruen A, Yang N. Selecting a portfolio of suppliers under demand and supply risks. Oper. Res. (2008) 56(4):916–936LinkGoogle Scholar
  • Feichtinger G, Hartl RF, Sethi SP. Dynamic optimal control models in advertising: Recent developments. Management Sci. (1994) 40(2):195–226LinkGoogle Scholar
  • Gans N. Customer loyalty and supplier quality competition. Management Sci. (2002) 48(2):207–221LinkGoogle Scholar
  • Gaur V, Park Y-H. Asymmetric consumer learning and inventory competition. Management Sci. (2007) 53(2):227–240LinkGoogle Scholar
  • Gittins J, Glazebrook K, Weber R. Multi-Armed Bandit Allocation Indices (2011) 2nd ed.(John Wiley & Sons, Chichester, UK) CrossrefGoogle Scholar
  • Glashoff K, Gustafson S-A. Linear Optimization and Approximation (1983) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Gupta S, Lehmann DR, Wierenga B. Models of customer value. Handbook of Marketing Decision Models (2008) (Springer Science + Business Media, New York) 255–290CrossrefGoogle Scholar
  • Hall J, Porteus E. Customer service competition in capacitated systems. Manufacturing Service Oper. Management (2000) 2(2):144–165LinkGoogle Scholar
  • Hernández-Lerma O, Lasserre JB. Discrete-Time Markov Control Processes—Basic Optimality Criteria (1996) (Springer, New York) CrossrefGoogle Scholar
  • Judd KL. Numerical Methods in Economics (1998) (MIT Press, Cambridge, MA) Google Scholar
  • Liu L, Shang W, Wu S. Dynamic competitive newsvendors with service-sensitive demands. Manufacturing Service Oper. Management (2007) 9(1):84–93LinkGoogle Scholar
  • Müller A, Stoyan D. Comparison Methods for Stochastic Models and Risks (2002) (John Wiley & Sons, Chichester, UK) Google Scholar
  • Nerlove M, Arrow KJ. Optimal advertising policy under dynamic conditions. Economica (1962) 29(114):129–142CrossrefGoogle Scholar
  • Olsen TL, Parker RP. Inventory management under market size dynamics. Management Sci. (2008) 54(10):1805–1821LinkGoogle Scholar
  • Powell W. Approximate Dynamic Programming: Solving the Curses of Dimensionality (2007) (Wiley Interscience, Hoboken, NJ) CrossrefGoogle Scholar
  • Reinartz WJ, Venkatesan R, Wierenga B. Decision models for customer relationship management (CRM). Handbook of Marketing Decision Models (2008) (Springer Science + Business Media, New York) 291–326CrossrefGoogle Scholar
  • Schweitzer PJ, Seidmann A. Generalized polynomial approximations in Markovian decision processes. J. Math. Anal. Appl. (1985) 110(2):568–582CrossrefGoogle Scholar
  • Sethi SP. Dynamic optimal control models in advertising: A survey. SIAM Rev. (1977) 19(4):685–725CrossrefGoogle Scholar
  • Simester DI, Sun P, Tsitsiklis JN. Dynamic catalog mailing policies. Management Sci. (2006) 52(5):683–696LinkGoogle Scholar
  • Weber RR, Weiss G. On an index policy for restless bandits. J. Appl. Prob. (1990) 27(3):637–648CrossrefGoogle Scholar
  • Whittle P. Restless bandits: Activity allocation in a changing world. J. Appl. Probab. (1988) 25:287–298CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.