Sensitivity of Optimal Capacity to Customer Impatience in an Unobservable M/M/S Queue (Why You Shouldn't Shout at the DMV)

References

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