Sensitivity of optimal capacity to customer impatience in an unobservable M/M/S queue (why you shouldn't shout at the dmv)

Manufacturing and Service Operations Management

Volumn 11, Issue 1, 2009, Pages 19-32

  Armony, Mor ^a   Plambeck, Erica ^b   Seshadri, Sridhar ^a  

^a NEW YORK UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Balking; Capacity planning; Queueing systems; Reneging; Sample path convexity; Stochastic convexity; Unobservable queues

Indexed keywords

BALKING; CAPACITY PLANNING; QUEUEING SYSTEMS; RENEGING; SAMPLE PATH CONVEXITY; STOCHASTIC CONVEXITY; UNOBSERVABLE QUEUES;

CUSTOMER SATISFACTION; MANAGERS; OPTIMIZATION; PERSONNEL TRAINING; QUEUEING NETWORKS; QUEUEING THEORY;

SALES;

EID: 67449169819     PISSN: 15234614     EISSN: 15265498     Source Type: Journal    
DOI: 10.1287/msom.1070.0194     Document Type: Article

References (49)

1. Afeche, P. 2004. Incentive-compatible revenue management in queueing systems: Optimal strategic idleness and other delaying tactics. Working paper, University of Toronto, Canada.
2. Armony M., M. Haviv. 2003. Price and delay competition between two service providers. Eur. J. Oper. Res. 147 (1) 32-50.
3. Armony, M., E. L. Plambeck. 2005. The impact of duplicate orders on demand estimation and capacity investment. Management Sci. 51 (10) 1505-1518.
4. Baccelli, F., G. Hebuterne. 1981. On queues with impatient customers. F. J. Kylatra, ed. Performance '81. North-Holland Publishing Company, Amsterdam, 159-179.
5. Bazaraa, M. S., H. D. Sherali, C. M. Shetty 1993. Nonlinear Programming: Theory and Algorithms, 2nd ed. John Wiley & Sons, Inc., New York.
6. Borst, S., A. Mandelbaum, M. I. Reiman. 2004. Dimensioning large call centers. Oper. Res. 52 (1) 17-34.
7. Brandt, A., M. Brandt. 2002. Asymptotic results and a Markovian approximation for the M (n) /M (n) /S + GI system. Queueing Systems 41 73-94.
8. Brown, L., N. Gans, A. Mandelbaum, A. Sakov, H. Shen, S. Zeltyn, L. Zhao. 2005. Statistical analysis of a telephone call center: A queueing-science perspective. J. Amer. Statist. Assoc. 100 (469) 36-50.
9. Chen, L., E. L. Plambeck. 2008. Dynamic inventory management with learning about the demand distribution and substitution probability. Manufacturing Service Oper. Management 10 (2) 236-256.
10. Cohen, M., P. Kleindorfer, H. Lee. 1988. Service constrained (s, S) inventory systems with priority demand classes and lost sales. Management Sci. 34 (4) 482-499.
11. Duenyas, I., W. J. Hopp. 1995. Quoting customer lead times. Management Sci. 41 43-57.
12. Fairlie, R. 2004. How a custom PC can come with some very alien payment policies. Computer Shopper (March 10) 28.
13. Feldman, Z., A. Mandelbaum, W. A. Massey W. Whitt. 2008. Staffing of time-varying queues to achieve time-stable performance. Management Sci. 54 (2) 324-338.
14. Garnett, O., A. Mandelbaum, M. Reiman. 2002. Designing a call center with impatient customers. Manufacturing Service Oper. Management 4 (3) 208-227.
15. Harrison, J. M., A. Zeevi. 2005. A method for staffing large call centers based on stochastic fluid models. Manufacturing Service Oper. Management 7 (1) 20-36.
16. Ho, T.-H., S. Savin, C. Terwiesch. 2002. Managing demand and sales dynamics in new product diffusion. Management Sci. 48 (2) 187-206.
17. Hopp, W. J., M. R. Sturgis. 2001. A simple and robust leadtimequoting policy. Manufacturing Service Oper. Management 3 (4) 331-336.
18. Johansen, S. G., R. M. Hill. 2000. The (r, Q) control of a periodicreview inventory system with continuous demand and lost sales. Internat. J. Production Econom. 68 279-286.
19. Johansen, S. G., A. Thorstenson. 1993. Optimal and approximate (Q, r) inventory policies with lost sales and gamma-distributed leadtimes. Internat. J. Production Econom. 30-31 179-194.
20. Johansen, S. G., A. Thorstenson. 1996. Optimal (r, Q) inventory policies with Poisson demands and lost sales: Discounted and undiscounted cases. Internat. J. Production Econom. 46-47 359-371.
21. Kapuscinski, R., S. Tayur. 2007. Reliable due date setting in a capacitated MTO system with two customer classes. Oper. Res. 55 (1) 56-74.
22. Keskinocak, P., R. Ravi, S. Tayur. 2001. Scheduling and reliable lead time quotation for orders with availability intervals and lead time sensitive revenues. Management Sci. 47 (2) 264-279.
23. Koole, G., A. Pot. 2006. A note on profit maximization and monotonicity for inbound call centers. Working paper, VU University of Amsterdam, The Netherlands.
24. Kumar, S., J. Swaminathan. 2003. Diffusion of innovations under supply constraints. Oper. Res. 51 (6) 866-879.
25. Lederer, P. J., L. Li. 1997. Pricing, production, scheduling, and delivery-time competition. Oper. Res. 45 (3) 407-420.
26. Li, L., Y. S. Lee. 1994. Pricing and delivery-time performance in a competitive environment. Management Sci. 40 (5) 633-646.
27. Maglaras, C., A. Zeevi. 2003. Pricing and capacity sizing for systems with shared resources: Approximate solutions and scaling relations. Management Sci. 49 (8) 1018-1038.
28. Mandelbaum, A., N. Shimkin. 2000. A model for rational abandonments from invisible queues. Queueing Systems 36 (1-3) 1084-1134.
29. Mandelbaum, A., S. Zeltyn. 1998. Estimating characteristics of queueing networks using transactional data. Queueing Systems 29 75-127.
30. Mandelbaum, A., S. Zeltyn. 2006. Staffing many-server queues with impatient customers: Constraint satisfaction in call centers. Working paper, Technion, Israel Institute of Technology, Haifa, Israel.
31. Mendelson, H., S. Whang. 1990. Optimal incentive-compatible priority pricing for the M/M/1 queue. Oper. Res. 38 (5) 870-883.
32. Moinzadeh, K., S. Nahmias. 1988. A continuous review model for an inventory system with two supply modes. Management Sci. 6 761-773.
33. Nahmias, S. 1979. Simple approximations for a variety of dynamic leadtime lost-sales inventory models. Oper. Res. 27 (5) 904-924.
34. Plambeck, E. L. 2004. Optimal leadtime differentiation via diffusion approximations. Oper. Res. 52 (2) 213-228.
35. Plambeck, E. L., A. R. Ward. 2006. Optimal control of a high-volume assemble-to-order system. Math. Oper. Res. 31 (3) 453-477.
36. Plambeck, E. L., A. R. Ward. 2007. Note: A separation principle for a class of assemble to order systems with expediting. Oper. Res. 55 (3) 603-609.
37. Porteus, E. L. 2002. Foundations of Stochastic Inventory Theory. Stanford University Press, Palo Alto, CA.
38. Randhawa, R., S. Kumar. 2005. Multi-server loss systems with subscribers. Working paper, Stanford University, Palo Alto, CA.
39. Reed, J. E., A. R. Ward. 2008. Approximating the GI/GI/1+GI queue with a nonlinear drift diffusion: Hazard rate scaling in heavy traffic. Math. Oper. Res. 33 (3) 606-644.
40. Shaked, M., J. G. Shanthikumar. 1988. Stochastic convexity and its applications. Adv. Appl. Probab. 20 427-446.
41. Shanthikumar, J. G., D. D. Yao. 1989. Second-order stochastic properties in queueing systems. Proc. IEEE 77 162-170.
42. Van Mieghem, J. 2000. Price and service discrimination in queueing systems: Incentive compatibility of Gcμ scheduling. Management Sci. 46 (9) 1249-1267.
43. Van Mieghem, J. A. 1995. Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. 5 (3) 809-833.
44. Ward, A. R., P. Glynn. 2005. A diffusion approximation for a GI/GI/1 queue with balking or reneging. Queueing Systems 50 371-400.
45. Ward, K. 2006. Asymptotically optimal admission control of a queue with impatient customers. Working paper, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA.
46. Whitt, W. 2005. Engineering solution of a basic call-center model. Management Sci. 51 (2) 221-235.
47. Whitt, W. 2006a. Fluid models for multiserver queues with abandonments. Oper. Res. 24 (1) 37-54.
48. Whitt, W. 2006b. Staffing a call center with uncertain arrival rate and absenteeism. Production Oper. Management 15 (1) 88-102.
49. Zeltyn, S., A. Mandelbaum. 2005. Call centers with impatient customers: Many-server asymptotics of the M/M/n+G queue. Queueing Systems 51 (3/4) 361-402.