Skip to main content
SpringerLink
Log in

Algorithm to find the optimal queueing discipline in a system with branching streams of secondary customers

  • Brief Communication
  • Published:
Cybernetics and Systems Analysis Aims and scope

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

References

  1. G. P. Klimov, “Time-sharing queueing systems, I,” Teor. Veroyatn. Primen.,19, No. 3, 558–576 (1974).

    MathSciNet  Google Scholar 

  2. M. Yu. Kitaev and V. V. Rykov, “Queueing system with branching streams of secondary customers,” Avtomat. Telemekh., No. 9, 52-61 (1980).

  3. E. A. Timofeev, “Optimization of mean queue lengths in a queueing system with branching streams of secondary customers,” Avtomat. Telemekh., No. 3, 60-67 (1995).

  4. F. R. Gantmakher, Matrix Theory [in Russian], Nauka, Moscow (1967).

    Google Scholar 

  5. G. P. Klimov, “Time-sharing queueing systems, II,” Teor. Veroyatn. Primen.,23, No. 2, 331–339 (1978).

    MATH  MathSciNet  Google Scholar 

Download references

Authors
  1. E. A. Timofeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 177–180, March–April, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Timofeev, E.A. Algorithm to find the optimal queueing discipline in a system with branching streams of secondary customers. Cybern Syst Anal 34, 309–312 (1998). https://doi.org/10.1007/BF02742084

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02742084

Keywords

Search

Navigation