Periodic Little’s Law

References

• Armony M, Israelit S, Mandelbaum A, Marmor Y, Tseytlin Y, Yom-Tov G (2015) On patient flow in hospitals: A data-based queueing-science perspective. Stochastic Systems 5(1):146–194.Link, Google Scholar
• Baccelli F, Bremaud P (1994) Elements of Queueing Theory (Springer, Berlin).Google Scholar
• Bertsimas D, Mourtzinou G (1997) Transient laws of non-stationary queueing systems and their applications. Queueing Systems 25(1–4):115–155.Crossref, Google Scholar
• Billingsley P (1995) Probability and Measure, 3rd ed. (Wiley, New York).Google Scholar
• Breiman L (1968) Probability (Addison-Wesley, New York).Google Scholar
• Bruneel H, Kim BG (1993) Discrete-Time Models for Communication Systems Including ATM (Kluwer Academic, Dordrecht, Netherlands).Crossref, Google Scholar
• Casella G, Berger RL (2002) Statistical Inference, 2nd ed. (Duxbury, Pacific Grove, CA).Google Scholar
• El-Taha M, Stidham S (1999) Sample-Path Analysis of Queueing Systems (Kluwer, Boston).Crossref, Google Scholar
• Fiems D, Bruneel H (2002) A note on the discretization of Little’s result. Oper. Res. Lett. 30(1):17–18.Crossref, Google Scholar
• Fralix BH, Riano G (2010) A new look at transient versions of Little’s law. J. Appl. Probab. 47(2):459–473.Crossref, Google Scholar
• Glynn PW, Whitt W (1986) A central-limit-theorem version of L = λW. Queueing Systems 2(1):191–215.Crossref, Google Scholar
• Glynn PW, Whitt W (1987) Sufficient conditions for functional limit theorem: Versions of L = λW. Queueing Systems 1(3):279–287.Crossref, Google Scholar
• Glynn PW, Whitt W (1988) Ordinary CLT and WLLN versions of L = λW. Math. Oper. Res. 13(4):674–692.Link, Google Scholar
• Glynn PW, Whitt W (1989a) Extensions of the queueing relations L = λW and H = λG. Oper. Res. 37(4):634–644.Link, Google Scholar
• Glynn PW, Whitt W (1989b) Indirect estimation via L = λW. Oper. Res. 37(1) 82–103.Link, Google Scholar
• Kim S, Whitt W (2013) Statistical analysis with Little’s law. Oper. Res. 61(4):1030–1045.Link, Google Scholar
• Kim S, Whitt W (2014a) Are call center and hospital arrivals well modeled by nonhomogeneous Poisson processes? Manufacturing Service Oper. Management 16(3):464–480.Link, Google Scholar
• Kim S, Whitt W (2014b) Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process. Naval Res. Logist. 61(1):66–90.Crossref, Google Scholar
• Little JDC (1961) A proof of the queueing formula: L = λW. Oper. Res. 9(3):383–387.Link, Google Scholar
• Little JDC (2011) Little’s law as viewed on its 50th anniversary. Oper. Res. 59(3):536–539.Link, Google Scholar
• Miyazawa M, Takahashi Y (1992) Rate conservation principle for discrete-time queues. Queueing Systems 12(3/4):215–230.Crossref, Google Scholar
• Rolski T (1989) Relationships between characteristics in periodic Poisson queues. Queueing Systems 4(1):17–26.Crossref, Google Scholar
• Rudin W (1976) Principles of Mathematical Analysis, 3rd ed. (McGraw-Hill, New York).Google Scholar
• Sigman K (1995) Stationary Marked Point Processes: An Intuitive Approach (Chapman and Hall/CRC, New York).Google Scholar
• Sigman K, Whitt W (2018) Marked point processes in discrete time. Working paper, Columbia University, New York. Available at http://www.columbia.edu/∼ww2040/allpapers.html.Google Scholar
• Stidham S (1974) A last word on L = λW. Oper. Res. 22(2):417–421.Link, Google Scholar
• Whitt W (1983) Comparing batch delays and customer delays. Bell System Tech. J. 62(7):2001–2009.Crossref, Google Scholar
• Whitt W (1991) A review of L = λW. Queueing Systems 9(3):235–268.Crossref, Google Scholar
• Whitt W (1992) Correction note on L = λW. Queueing Systems 12(4):431–432.Crossref, Google Scholar
• Whitt W (2012) Extending the FCLT version of L = λW. Oper. Res. Lett. 40(4):230–234.Crossref, Google Scholar
• Whitt W, Zhang X (2017) A data-driven model of an emergency department. Oper. Res. Health Care 12(1):1–15.Google Scholar
• Whitt W, Zhang X (2019) A central-limit-theorem version of the periodic Little’s law. Queueing Systems 91(1-2):15–47.Google Scholar
• Wolfe RW, Yao Y-C (2014) Little’s law when the average waiting time is infinite. Queueing Systems 76(3):267–281.Crossref, Google Scholar