Staffing of Time-Varying Queues to Achieve Time-Stable Performance

References

• Bolotin V., Labetoulle J., Roberts J. W. Telephone circuit holding-time distributions. Proc. 14th Internat. Teletraffic Congress (1994) (Elsevier, North-Holland, Amsterdam) 125–134Google 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(1):36–50Crossref, Google Scholar
• Eick S., Massey W. A., Whitt W. The physics of the Mt/G/∞ queue. Oper. Res. (1993a) 41(4):731–742Link, Google Scholar
• Eick S., Massey W. A., Whitt W. Mt/G/∞ queues with sinusoidal arrival rates. Management Sci. (1993b) 39(2):241–252Link, Google Scholar
• Gans N., Koole G., Mandelbaum A. Telephone call centers: Tutorial, review and research prospects. Manufacturing Service Oper. Management (2003) 5(2):79–141Link, Google Scholar
• Garnett O., Mandelbaum A., Reiman M. I. Designing a call center with impatient customers. Manufacturing Service Oper. Management (2002) 4(3):208–227Link, Google Scholar
• Green L. V., Kolesar P. J. The pointwise stationary approximation for queues with nonstationary arrivals. Management Sci. (1991) 37(1):84–97Link, Google Scholar
• Green L. V., Kolesar P. J., Soares J. Improving the SIPP approach for staffing service systems that have cyclic demand. Oper. Res. (2001) 49(4):549–564Link, Google Scholar
• Green L. V., Kolesar P. J., Whitt W. Coping with time-varying demand when setting staffing requirements for a service system. Production Oper. Management (2007) 16(1):13–39Crossref, Google Scholar
• Halfin S., Whitt W. Heavy-traffic limits for queues with many exponential servers. Oper. Res. (1981) 29(3):567–588Link, Google Scholar
• Jagerman D. L. Nonstationary blocking in telephone traffic. Bell System Tech. J. (1975) 54:625–661Crossref, Google Scholar
• Jennings O. B., Mandelbaum A., Massey W. A., Whitt W. Server staffing to meet time-varying demand. Management Sci. (1996) 42(10):1383–1394Link, Google Scholar
• Kamae T., Krengel U., O'Brien G. L. Stochastic inequalities on partially ordered spaces. Ann. Probab. (1977) 5(6):899–912Crossref, Google Scholar
• Mandelbaum A., Massey W. A., Reiman M. I. Strong approximations for Markovian service networks. Queueing Systems: Theory Appl. (QUESTA) (1998) 30(1–2):149–201Crossref, Google Scholar
• Massey W. A., Whitt W. Networks of infinite-server queues with nonstationary Poisson input. Queueing Systems (1993) 13(1):183–250Crossref, Google Scholar
• Massey W. A., Whitt W. An analysis of the modified offered load approximation for the Erlang loss model. Ann. Appl. Probab. (1994) 4(4):1145–1160Crossref, Google Scholar
• Massey W. A., Whitt W. Peak congestion in multi-server service systems with slowly varying arrival rates. Queueing Systems (1997) 25(1–4):157–172Crossref, Google Scholar
• Massey W. A., Whitt W. Uniform acceleration expansions for Markov chains with time-varying rates. Ann. Appl. Probab. (1998) 9(4):1130–1155Google Scholar
• Müller A., Stoyan D.Comparison Methods for Stochastic Models and Risks (2002) (John Wiley & Sons, Chichester, UK) Google Scholar
• Ross S. M.A Course in Simulation (1990) (Macmillan, New York) Google Scholar
• Ross S. M.Stochastic Processes (1996) 2nd ed.(John Wiley & Sons, New York) Google Scholar
• Wallace R. B., Whitt W. A staffing algorithm for call centers with skill-based routing. Manufacturing Service Oper. Management (2005) 7(4):276–294Link, Google Scholar
• Whitt W. Comparing counting processes and queues. Adv. Appl. Probab. (1981) 13:207–220Crossref, Google Scholar
• Whitt W. The pointwise stationary approximation for Mt/Mt/s queues is asymptotically correct as the rates increase. Management Sci. (1991) 37(3):307–314Link, Google Scholar
• Whitt W. Understanding the efficiency of multi-server service systems. Management Sci. (1992) 38(5):708–723Link, Google Scholar
• Whitt W. Engineering solution of a basic call-center model. Management Sci. (2005) 51(2):221–235Link, Google Scholar