Skip to main content
SpringerLink
Log in

Elaborated Analysis of a Nonreplenishable Queue with Erlang Distribution of the Service Time

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract—

The present paper considers a service system without the input flow of claims, that is, all claims are present in the queue initially from the beginning. The number of such claims equals Θmax, whereas the number of servers equals k. The time of one service has the Erlang distribution. The paper aims to calculate the time distribution until the completion of all services, as well as the average waiting time of one claim.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.
Fig. 9.

REFERENCES

  1. Andronov, A.M., Dalinger, I.M., and Spiridovska, N., Computational analysis of a service system with non-replenish queue, Distributed Computer and Communication Networks. DCCN 2022, Vishnevskiy, V.M., Samouylov, K.E., and Kozyrev, D., Eds., Communication in Computer and Information Systems, vol. 1748, Cham: Springer, 2022, pp. 223–233. https://doi.org/10.1007/978-3-031-30648-8_18

  2. Kijima, M., Markov Processes for Stochastic Modeling, New York: Springer, 1997. https://doi.org/10.1007/978-1-4899-3132-0

    Book  Google Scholar 

  3. Feller, W., An Introduction to Probability Theory and its Applications, New York: Wiley, 1971, 2nd ed, vol. 2.

    Google Scholar 

  4. Cox, D.R., Renewal Theory, London: Methuen and Co, 1961.

    Google Scholar 

  5. Smith, W.I., Renewal theory and its ramifications, J. R. Stat. Soc.: Ser. B (Methodological), 1958, vol. 20, no. 2, pp. 243–284. https://doi.org/10.1111/j.2517-6161.1958.tb00294.x

    Article  MathSciNet  Google Scholar 

  6. De Jonge, B. and Scarf, P.A., A review on maintenance optimization, Eur. J. Oper. Res., 2020, vol. 285, no. 3, pp. 805–824. https://doi.org/10.1016/j.ejor.2019.09.047

    Article  MathSciNet  Google Scholar 

  7. Prabhu, N.U., Queues and Inventories, New York: John Wiley & Sons, 1965.

    Google Scholar 

  8. Trivedi, K.S., Probability and Statistics with Reliability, New York: Wiley, 2002.

    Google Scholar 

  9. Neuts, M.F., Probability distribution of phase type, Liber Amicorum Professor Emeritus H. Florin, Louvain-la-Neuve, Belgium: Department of Mathematics, Univ. of Louvain, 1975, pp. 173–206.

    Google Scholar 

Download references

Funding

This work was supported by ongoing institutional funding. No additional grants to carry out or direct this particular research were obtained.

Author information

Authors and Affiliations

  1. Transport and Telecommunication Institute, Riga, LV-1019, Latvia

    Alexander M. Andronov & Kristina Mahareva

Authors
  1. Alexander M. Andronov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kristina Mahareva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Alexander M. Andronov or Kristina Mahareva.

Ethics declarations

The authors of this work declare that they have no conflicts of interest.

Additional information

Publisher’s Note.

Allerton Press remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Andronov, A.M., Mahareva, K. Elaborated Analysis of a Nonreplenishable Queue with Erlang Distribution of the Service Time. Aut. Control Comp. Sci. 58, 1–10 (2024). https://doi.org/10.3103/S0146411624010024

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411624010024

Keywords:

Search

Navigation