Abstract
A“scheduled” arrival process is one in which the nth arrival is scheduled for time n, but instead occurs at \(n+\xi _n\) , where the \(\xi _j\)’s are i.i.d. We describe here the behavior of a single server queue fed by such traffic in which the processing times are deterministic. A particular focus is on perturbations with Pareto-like tails but with finite mean. We obtain tail approximations for the steady-state workload in both cases where the queue is critically loaded and under a heavy-traffic regime. A key to our approach is our analysis of the tail behavior of a sum of independent Bernoulli random variables with parameters of the form \(p_n\sim c \,n^{-\alpha }\) as \(n\rightarrow \infty \), for \(c>0\) and \(\alpha >1\).
Similar content being viewed by others
References
Araman, V.F., Glynn, P.W.: Fractional Brownian motion with \(H < 1/2\) as a limit of scheduled traffic. J. Appl. Probab. 49(3), 1169–1188 (2012)
Asmussen, S.: Applied Probability and Queues. Springer, New York (2003)
Chen, H., Zhao, Y.J.: A new queueing model for aircraft landing process (1997). https://doi.org/10.2514/6.1997-3737
Chung, K.L.: A Course in Probability Theory. Academic Press, San Diego (1974)
Davis, B., McDonald, D.: An elementary proof of the local central limit theorem. J. Theor. Probab. 8(3), 693–701 (1995)
Dembo, A., Zeitouni, O.: Large Deviations Techniques and Applications. Springer, New York (1998)
Doi, M., Chen, Y.-M., Ōsawa, H.: A queueing model in which arrival times are scheduled. Oper. Res. Lett. 21(5), 249–252 (1997)
Feller, W.: An Introduction to Probability Theory and Its Applications, vol. II. Wiley, New York (1971)
Glynn, P.W.: Diffusion approximations. In: Heyman, D., Sobel, M. (eds.) Stochastic Models: Handbooks of OR & MS, vol. 2. Elsevier Science, Amsterdam (1990)
Hassin, R., Mendel, S.: Scheduling arrivals to queues: a single-server model with no-shows. Manag. Sci. 54(3), 565–572 (2008)
Honnappa, H., Jain, R., Ward, A.: On transitory queueing. Working paper, Purdue University, West Lafayette, IN (2018)
Kemper, B., Klaassen, C.K.J., Mandjes, M.: Optimized appointment scheduling. EJOR 239(1), 243–255 (2014)
Kingman, J.F.C.: On queues in heavy traffic. J. R. Stat. Soc. Ser. B (Methodological) 24(2), 383–392 (1962)
Loynes, R.M.: The stability of a queue with non-independent inter-arrival and service times. Math. Proc. Camb. Philos. Soc. 58(3), 497–520 (1962). https://doi.org/10.1017/S0305004100036781
Luo, J., Kulkarni, V.G., Ziya, S.: A tandem queueing model for an appointment-based service system. Queueing Syst. 79(1), 53–85 (2015)
Mercer, A.: A queueing problem in which the arrival times of the customers are scheduled. J. R. Stat. Soc. Ser. B (Methodological) 22(1), 108–113 (1960)
Mercer, A.: Queues with scheduled arrivals: a correction, simplification and extension. J. R. Stat. Soc. Ser. B (Methodological) 35(1), 104–116 (1973)
Ross, S.M.: Stochastic Processes, 2nd Edition John Wiley and Sons (1996)
Ross, S.M.: A First Course in Probability. Pearson Prentice Hall, Upper Saddle River (2015)
Winsten, C.B.: Geometric distributions in the theory of queues. J. R. Stat. Soc. Ser. B (Methodological) 21(1), 1–35 (1959)
Zacharias, C., Armony, M.: Joint panel sizing and and appointment scheduling in outpatient care. Manag. Sci. 63(11), 3978–3997 (2017)
Acknowledgements
The authors are very grateful to the Associate Editor and the two referees for their careful reading of the paper and for their helpful and constructive comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Araman, V.F., Chen, H., Glynn, P.W. et al. On a single server queue fed by scheduled traffic with Pareto perturbations. Queueing Syst 100, 61–91 (2022). https://doi.org/10.1007/s11134-021-09732-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-021-09732-9