Dynamic capacity allocation to customers who remember past service

Management Science

Volumn 59, Issue 3, 2013, Pages 592-612

  Adelman, Daniel ^a   Mersereau, Adam J ^b  

^a UNIVERSITY OF CHICAGO   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Approximate; Behavioral operations; Capacity allocation; Customer relationship management; Dynamic programming

Indexed keywords

APPROXIMATE; APPROXIMATE DYNAMIC PROGRAMMING; BEHAVIORAL OPERATIONS; CAPACITY ALLOCATION; CUSTOMER RELATIONSHIP MANAGEMENT; DYNAMIC CAPACITY ALLOCATIONS; FILL RATE; LAGRANGIAN; LIMITED CAPACITY; MEMORY EFFECTS; ORDER QUANTITY; SUPPLIER PROFIT;

DYNAMIC PROGRAMMING; PROFITABILITY;

SALES;

EID: 84874727124     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.1120.1643     Document Type: Review

References (30)

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