Sampling the Functional Kolmogorov Forward Equations for Nonstationary Queueing Networks

Published Online:https://doi.org/10.1287/ijoc.2016.0702

References

  • Clark GM (1981) Use of Polya distributions in approximate solutions to nonstationary M/M/s queues. Comm. ACM 24(4):206–217.CrossrefGoogle Scholar
  • Down DG, Lewis ME (2010) The n-network model with upgrades. Probab. Engrg. Informational Sci. 24(02):171–200.CrossrefGoogle Scholar
  • Engblom S (2014) On the stability of stochastic jump kinetics. Appl. Math. 5(19):3217–3239.CrossrefGoogle Scholar
  • Engblom S, Pender J (2014) Approximations for the moments of nonstationary and state dependent birth-death queues. Accessed June 22, 2016, http://arxiv.org/abs/1406.6164.Google Scholar
  • García ML, Centeno MA, Rivera C, DeCario N (1995) Reducing time in an emergency room via a fast-track. Simulation Conf. Proc. Winter (IEEE, Arlington, VA), 1048–1053.CrossrefGoogle Scholar
  • Green L (2006) Queueing analysis in healthcare. Patient Flow: Reducing Delay in Healthcare Delivery (Springer, New York), 281–307.CrossrefGoogle Scholar
  • Gurvich I, Perry O (2012) Overflow networks: Approximations and implications to call center outsourcing. Oper. Res. 60(4):996–1009.LinkGoogle Scholar
  • Ko YM, Pender J (2016) Strong approximations for time varying infinite-server queues with non-renewal arrival and service processes. Accessed June 22, 2016, http://people.orie.cornell.edu/jpender/.Google Scholar
  • Liu Y, Whitt W (2014) Many-server heavy-traffic limit for queues with time-varying parameters. Ann. Appl. Probab. 24(1):378–421.CrossrefGoogle Scholar
  • Mandelbaum A, Massey WA (1995) Strong approximations for time-dependent queues. Math. Oper. Res. 20(1):33–64.LinkGoogle Scholar
  • Mandelbaum A, Massey WA, Reiman MI (1998) Strong approximations for Markovian service networks. Queueing Systems 30(1–2):149–201.CrossrefGoogle Scholar
  • Massey WA (1985) Asymptotic analysis of the time dependent M/M/1 queue. Math. Oper. Res. 10(2):305–327.LinkGoogle Scholar
  • Massey WA, Pender J (2011) Skewness variance approximation for dynamic rate multiserver queues with abandonment. Performance Evaluation Rev. 39(2):74.CrossrefGoogle Scholar
  • Massey WA, Pender J (2013) Gaussian skewness approximation for dynamic rate multi-server queues with abandonment. Queueing Systems 75(2):243–277.CrossrefGoogle Scholar
  • Massey WA, Pender J (2016) Approximating and stabilizing Jackson networks with abandonment. Probab. Engrg. Informational Sci. Forthcoming.Google Scholar
  • Massey WA, Whitt W (1998) Uniform acceleration expansions for markov chains with time-varying rates. Ann. Appl. Probab. 8(4):1130–1155.CrossrefGoogle Scholar
  • Pender J (2013) Gaussian approximations for nonstationary loss networks with abandonment. Accessed June 22, 2016, https://people.orie.cornell.edu/jpender/Loss_Network.pdf.Google Scholar
  • Pender J (2014a) Laguerre polynomial expansions for time varying multiserver queues with abandonment. Accessed June 22, 2016, http://people.orie.cornell.edu/jpender/LSA.pdf.Google Scholar
  • Pender J (2014b) Gram Charlier expansions for time varying multi-server queues with abandonment. SIAM. J. Appl. Math. 74(4):1238–1265.CrossrefGoogle Scholar
  • Pender J (2014c) A Poisson–Charlier approximation for nonstationary queues. Oper. Res. Lett. 42(4):293–298.CrossrefGoogle Scholar
  • Pender J (2015) An analysis of nonstationary coupled queues. Telecomm. Systems 61(4):1–16.Google Scholar
  • Pender J, Ko YM (2016) Approximations for the queue length distributions of time-varying many-server queues. Accessed June 22, 2016, http://people.orie.cornell.edu/jpender/.Google Scholar
  • Rothkopf MH, Oren SS (1979) A closure approximation for the nonstationary M/M/s queue. Management Sci. 25(6):522–534.LinkGoogle Scholar
  • Siddharthan K, Jones WJ, Johnson JA (1996) A priority queuing model to reduce waiting times in emergency care. Internat. J. Health Care Quality Assurance 9(5):10–16.CrossrefGoogle Scholar
  • Stein C (1986) Approximate computation of expectations. Lecture Notes-Monograph Ser. 7:i–164.Google Scholar
  • Taaffe MR, Ong KL (1987) Approximating nonstationary Ph(t)/M(t)/s/c queueing systems. Ann. Oper. Res. 8(1):103–116.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.