Time-Varying Robust Queueing

References

• Bandi C, Bertsimas D, Youssef N (2015) Robust queueing theory. Oper. Res. 63(3):676–700.Link, Google Scholar
• Bandi C, Bertsimas D, Youssef N (2018) Robust transient analysis of multi-server queueing systems and feed-forward networks. Queueing Systems 89(3–4):351–413.Crossref, Google Scholar
• Ben-Tal A, El-Ghaoui L, Nemirovski A (2009) Robust Optimization (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Bertsimas D, Thiele A (2006) A robust optimization approach to inventory theory. Oper. Res. 54(1):150–168.Link, Google Scholar
• Bertsimas D, Brown DB, Caramanis C (2011a) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.Crossref, Google Scholar
• Bertsimas D, Gamarnik D, Rikun AA (2011b) Performance analysis of queueing networks via robust optimization. Oper. Res. 59(2):455–466.Link, Google Scholar
• Beyer HG, Sendhoff B (2007) Robust optimzation: A comprehensive survey. Comput. Methods Appl. Mech. Engrg. 196(33–34):3190–3218.Crossref, Google Scholar
• Choudhury GL, Lucantoni DL, Whitt W (1997a) Numerical solution of piecewise-stationary M_{t}/G_{t}/1queues. Oper. Res. 45(3):451–463.Link, Google Scholar
• Choudhury GL, Mandelbaum A, Reiman MI, Whitt W (1997b) Fluid and diffusion limits for queues in slowly changing random environments. Stochastic Models 13(1):121–146.Crossref, Google Scholar
• Cox DR, Lewis PAW (1966) The Statistical Analysis of Series of Events (Methuen, London).Crossref, Google Scholar
• Edie LC (1954) Traffic delays at toll booths. Oper. Res. 2(2):107–138.Link, Google Scholar
• Green LV, Kolesar PJ (1991) The pointwise stationary approximation for queues with nonstationary arrivals. Management Sci. 37(1):84–97.Link, Google Scholar
• Harrison JM, Lemoine AJ (1977) Limit theoorems for periodic queues. J. Appl. Probab. 14(3):566–576.Crossref, Google Scholar
• Heyman DP, Whitt W (1984) The asymptoic behavior of queues with time-varying arrivals. J. Appl. Probab. 21(1):143–156.Crossref, Google Scholar
• Jennings OB, Mandelbaum A, Massey WA, Whitt W (1996) Server staffing to meet time-varying demand. Management Sci. 42(10):1383–1394.Link, Google Scholar
• Keller J (1982) Time-dependent queues. SIAM Rev. 24(4):401–412.Crossref, Google Scholar
• Kolesar PJ, Rider PJ, Craybill TB, Walker WE (1975) A queueing-linear-programming approach to scheduling police patrol cars. Oper. Res. 23(6):1045–1062.Link, Google Scholar
• Koopman BO (1972) Air-terminal queues under time-dependent conditions. Oper. Res. 20(6):1089–1114.Link, Google Scholar
• Lemoine AJ (1981) On queues with periodic Poisson input. J. Appl. Probab. 18(4):889–900.Crossref, Google Scholar
• Lemoine AJ (1989) Waiting time and workload in queues with periodic Poisson input. J. Appl. Probab. 26(2):390–397.Crossref, Google Scholar
• Ma N, Whitt W (2018a) A rare-event simulation algorithm for periodic single-server queues. INFORMS J. Comput. 30(1):71–89.Link, Google Scholar
• Ma N, Whitt W (2019) Minimizing the maximum expected waiting time in a periodic single-server queue with a service-rate control. Stochastic Systems. Forthcoming.Link, Google Scholar
• Mandelbaum A, Massey WA (1995) Strong approximations for time-dependent queues. Math. Oper. Res. 20(1):33–64.Link, Google Scholar
• Mandelbaum A, Massey WA, Reiman MI (1998) Strong approximations for Markovian service networks. Queueing Systems 30(1):149–201.Crossref, Google Scholar
• Massey WA (1985) Asymptotic analysis of the time-varying M/M/1 queue. Math. Oper. Res. 10(2):305–327.Link, Google Scholar
• Massey WA, Pender J (2013) Gaussian skewness approximation for dynamic rate multi-server queues with abandonment. Queueing Systems 75(2–4):243–277.Crossref, Google Scholar
• Massey WA, Whitt W (1998) Uniform acceleration expansions for Markov chains with time-varying rates. Ann. Appl. Probab. 9(4):1130–1155.Google Scholar
• Newell GF (1968a) Queues with time dependent arrival rates, I. The transition through saturation. J. Appl. Probab. 5(2):436–451.Crossref, Google Scholar
• Newell GF (1968b) Queues with time dependent arrival rates, II. The maximum queue and the return to equilibrium. J. Appl. Probab. 5(3):579–590.Crossref, Google Scholar
• Newell GF (1968c) Queues with time dependent arrival rates, III. A mild rush hour. J. Appl. Probab. 5(3):591–606.Crossref, Google Scholar
• Oliver RM, Samuel AH (1962) Reducing letter delays in post offices. Oper. Res. 10(6):839–892.Link, Google Scholar
• Ong KL, Taaffe MR (1989) Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers. Queueing Systems 4(1):27–46.Crossref, Google Scholar
• Pender J, Massey WA (2017) Approximating and stabilizing dynamic rate Jackson networks with abandonment. Probab. Engrg. Inform. Sci. 31(1):1–42.Crossref, Google Scholar
• Rolski T (1989) Queues with nonstationary inputs. Queueing Systems 5(1–3):113–130.Crossref, Google Scholar
• Rothkopf MH, Oren SS (1979) A closure approximation for the nonstationary M/M/s queue. Management Sci. 25(6):522–534.Link, Google Scholar
• Taaffe MR, Ong KL (1987) Approximating Ph(t)/M(t)/S/C queueing systems. Ann. Oper. Res. 8(1):103–116.Crossref, Google Scholar
• Whitt W (1982) Approximating a point process by a renewal process: Two basic methods. Oper. Res. 30(1):125–147.Link, Google Scholar
• Whitt W (1991) The pointwise stationary approximation for M_{t}/M_{t}/s queues is asymptotically correct as the rates increase. Management Sci. 37(3):307–314.Link, Google Scholar
• Whitt W (2002) Stochastic-Process Limits (Springer, New York).Crossref, Google Scholar
• Whitt W (2014) Heavy-traffic limits for queues with periodic arrival processes. Oper. Res. Lett. 42(6–7):458–461.Crossref, Google Scholar
• Whitt W (2015) Stabilizing performance in a single-server queue with time-varying arrival rate. Queueing Syst. 81(4):341–378.Crossref, Google Scholar
• Whitt W (2016) Heavy-traffic limits for a single-server queue leading up to a critical point. Oper. Res. Lett. 44(6):796–800.Crossref, Google Scholar
• Whitt W, You W (2018a) A robust queueing network analyzer based on indices of dispersion. Working paper, Columbia University, New York.Google Scholar
• Whitt W, You W (2018b) Using robust queueing to expose the impact of dependence in single-server queues. Oper. Res. 66(1):184–199.Link, Google Scholar