Scaling Limits for Infinite-server Systems in a Random Environment

References

• D. Anderson, J. Blom, M. Mandjes, H. Thorsdottir, and K. de Turck. A functional central limit theorem for a Markov-modulated infinite-server queue. Methodology and Computing in Applied Probability, 2016. MR3465473Google Scholar
• A. Bassamboo, R.S. Randhawa, and A. Zeevi. Capacity sizing under parameter uncertainty: Safety staffing principles revisited. Management Science, 56(10):1668–1686, 2010.Link, Google Scholar
• J. Blom, K. de Turck, O. Kella, and M. Mandjes. Tail asymptotics of a Markov-modulated infinite-server queue. Queueing Systems, 78(4):337–357, 2014. MR3269262Google Scholar
• J. Blom, K. de Turck, and M. Mandjes. Analysis of Markov-modulated infinite-server queues in the central-limit regime. Probability in the Engineering and Informational Sciences, 29:433–459, 2015. MR3355613Google Scholar
• D.R. Cox. Some statistical methods connected with series of events journal of the Royal Statistical Society. Journal of the Royal Statistical Society, Series B (Methodological), 17(2):129–164, 1955. MR0092301Google Scholar
• K. de Turck and M. Mandjes. Large deviations of an infinite-server system with a linearly scaled background process. Performance Evaluation, 75–76:36–49, 2014.Google Scholar
• A. Dembo and O. Zeitouni. Large Deviations Techniques and Applications. Springer, New York, 1998. MR1619036Google Scholar
• S. Kim and W. Whitt. Are call center and hospital arrivals well modeled by nonhomogeneous Poisson processes? Manufacturing & Service Operations Management, 16(3):464–480, 2014.Link, Google Scholar
• S. Kim and W. Whitt. Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process. Naval Research Logistics, 61(1):66–90, 2014. MR3162951Google Scholar
• Y. Liu and W. Whitt. Stabilizing customer abandonment in many-server queues with time-varying arrivals. Operations Research, 60(6):1551–1564, 2012. MR3009182Link, Google Scholar
• H. Lu and G. Pang. Gaussian limits for a fork-join network with non-exchangeable synchronization in heavy traffic. Mathematics of Operations Research, 2015.Google Scholar
• H. Lu and G. Pang. Heavy-traffic limits for a fork-join network in a renewal random environment. Submitted, 2015. MR3486808Google Scholar
• S. Maman. Uncertainty in the demand of service: The case of call centers and emergency departments. M. Sc. Thesis, Technion – Israel Institute of Technology, Haifa, Israel, 2009.Google Scholar
• Ibrahim. R. H. Ye, P. L’Ecuyer, and H. Shen. Modeling and forecasting call center arrivals: a literature survey. International Journal of Forecasting, 32:865–874, 2016.Google Scholar
• T. Rydén. An EM algorithm for estimation in Markov-modulated Poisson processes. Computational Statistics & Data Analysis, 21:431–447, 1996. MR1394060Google Scholar
• W. Whitt. Dynamic staffing in a telephone call center aiming to immediately answer all calls. Operations Research Letters, 24(5):205–212, 1999. MR1719916Google Scholar
• W. Whitt, L. V. Green, and P. J. Kolesar. Coping with time-varying demand when setting staffing requirements for a service system. Production and Operations Management, 16(1):13–39, 2007.Google Scholar