Dynamic Capacity Allocation to Customers Who Remember Past Service
Published Online:19 Dec 2012https://doi.org/10.1287/mnsc.1120.1643
References
- . Relaxations of weakly coupled stochastic dynamic programs. Oper. Res. (2008) 56(3):712–727Link, Google Scholar
- . Managing retention in service relationships. (2012) . Working paper, INSEAD, SingaporeCrossref, Google Scholar
- . Neuro-Dynamic Programming (1996) (Athena Scientific, Belmont, MA) Google Scholar
- . Capacity allocation using past sales: When to turn-and-earn. Management Sci. (1999) 45(5):685–703Link, Google Scholar
- . Obtaining fast service in a queueing system via performance-based allocation of demand. Management Sci. (2007) 53(3):408–420Link, Google Scholar
- . The inverse newsvendor problem: Choosing an optimal demand portfolio for capacitated resources. Management Sci. (2000) 46(7):912–927Link, Google Scholar
- . The linear programming approach to approximate dynamic programming. Oper. Res. (2003) 51(6):850–865Link, Google Scholar
- . An empirical model of advertising dynamics. Quant. Market. Econom. (2005) 3(2):107–144Crossref, Google Scholar
- . Probability models for customer-base analysis. J. Interactive Marketing (2009) 23(1):61–69Crossref, Google Scholar
- . Selecting a portfolio of suppliers under demand and supply risks. Oper. Res. (2008) 56(4):916–936Link, Google Scholar
- . Dynamic optimal control models in advertising: Recent developments. Management Sci. (1994) 40(2):195–226Link, Google Scholar
- . Customer loyalty and supplier quality competition. Management Sci. (2002) 48(2):207–221Link, Google Scholar
- . Asymmetric consumer learning and inventory competition. Management Sci. (2007) 53(2):227–240Link, Google Scholar
- . Multi-Armed Bandit Allocation Indices (2011) 2nd ed.(John Wiley & Sons, Chichester, UK) Crossref, Google Scholar
- . Linear Optimization and Approximation (1983) (Springer-Verlag, New York) Crossref, Google Scholar
- , Wierenga B. Models of customer value. Handbook of Marketing Decision Models (2008) (Springer Science + Business Media, New York) 255–290Crossref, Google Scholar
- . Customer service competition in capacitated systems. Manufacturing Service Oper. Management (2000) 2(2):144–165Link, Google Scholar
- . Discrete-Time Markov Control Processes—Basic Optimality Criteria (1996) (Springer, New York) Crossref, Google Scholar
- . Numerical Methods in Economics (1998) (MIT Press, Cambridge, MA) Google Scholar
- . Dynamic competitive newsvendors with service-sensitive demands. Manufacturing Service Oper. Management (2007) 9(1):84–93Link, Google Scholar
- . Comparison Methods for Stochastic Models and Risks (2002) (John Wiley & Sons, Chichester, UK) Google Scholar
- . Optimal advertising policy under dynamic conditions. Economica (1962) 29(114):129–142Crossref, Google Scholar
- . Inventory management under market size dynamics. Management Sci. (2008) 54(10):1805–1821Link, Google Scholar
- . Approximate Dynamic Programming: Solving the Curses of Dimensionality (2007) (Wiley Interscience, Hoboken, NJ) Crossref, Google Scholar
- , Wierenga B. Decision models for customer relationship management (CRM). Handbook of Marketing Decision Models (2008) (Springer Science + Business Media, New York) 291–326Crossref, Google Scholar
- . Generalized polynomial approximations in Markovian decision processes. J. Math. Anal. Appl. (1985) 110(2):568–582Crossref, Google Scholar
- . Dynamic optimal control models in advertising: A survey. SIAM Rev. (1977) 19(4):685–725Crossref, Google Scholar
- . Dynamic catalog mailing policies. Management Sci. (2006) 52(5):683–696Link, Google Scholar
- . On an index policy for restless bandits. J. Appl. Prob. (1990) 27(3):637–648Crossref, Google Scholar
- . Restless bandits: Activity allocation in a changing world. J. Appl. Probab. (1988) 25:287–298Crossref, Google Scholar

