Technical Note–Stability of a Queue Fed by Scheduled Traffic at Critical Loading

Published Online:https://doi.org/10.1287/opre.2023.0039

References

  • Araman VF, Glynn PW (2012) Fractional Brownian motion with H<1/2 as a limit of scheduled traffic. J. Appl. Probab. 49(3):1169–1188.CrossrefGoogle Scholar
  • Araman VF, Chen H, Glynn PW, Xia L (2022) On a single server queue fed by scheduled traffic with Pareto perturbations. Queueing Systems 100:61–91.CrossrefGoogle Scholar
  • Chen H, Zhao YJ (1997) A new queueing model for aircraft landing process. Accessed January 2023, https://arc.aiaa.org/doi/abs/10.2514/6.1997-3737.Google Scholar
  • Doob JL (1953) Stochastic Processes (John Wiley & Sons, New York).Google Scholar
  • Erickson K (1970) Strong renewal theorems with infinite mean. Trans. Amer. Math. Soc. 151(1):263–291.CrossrefGoogle Scholar
  • Kingman JFC (1962) On queues in heavy traffic. J. R. Statist. Soc. B 24(2):383–392.CrossrefGoogle Scholar
  • Lindley DV (1952) The theory of queues with a single server. Math. Proc. Cambridge Philospoh. Soc. 48(2):277–289.CrossrefGoogle Scholar
  • Loynes RM (1962) The stability of a queue with non-independent inter-arrival and service times. Math. Proc. Cambridge Philospoh. Soc. 58(3):497–520.CrossrefGoogle Scholar
  • Mercer A (1960) A queueing problem in which the arrival times of the customers are scheduled. J. R. Statist. Soc. B 22(1):108–113.CrossrefGoogle Scholar
  • Mercer A (1973) Queues with scheduled arrivals: A correction, simplification and extension. J. R. Statist. Soc. B 35(1):104–116.CrossrefGoogle Scholar
  • Winsten CB (1959) Geometric distributions in the theory of queues. J. R. Statist. Soc. B 21(1):1–35.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.