Skip to main content
SpringerLink
Log in

Limits on stationary queue length under various service disciplines

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

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

Literature cited

  1. L. Schrage, “The queue M¦G¦1 with feedback to lower priority queues,” Management Science,13, No. 7, 466–474 (1967).

    Google Scholar 

  2. A. V. Pechinkin, “Stationary probabilities in a system with priority sharing of the processor,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 5, 73–77 (1980).

    Google Scholar 

  3. L. Schrage and L. Miller, “The queue M¦G¦1 with the shortest remaining processing time discipline,” Oper. Res.,14, No. 4, 670–684 (1966).

    Google Scholar 

  4. A. V. Pechinkin, A. D. Solov'ev, and S. F. Yashkov, “On a system with discipline serving the first customer with minimum completed processing time,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 5, 51–58 (1979).

    Google Scholar 

  5. L. Schrage, “A proof of the optimality of the shortest remaining processing time discipline, ” Oper. Res.,16, No. 4, 687–690 (1968).

    Google Scholar 

  6. V. V. Kozlov, “Optimal service discipline for queueing systems,” Nauchnye Trudy Kubansk. Univ., 33–37 (1977).

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

    Google Scholar 

  8. E. B. Veklerov, “On optimal priorities in queueing systems,” Avtomat. Telemekh., No. 6, 149–153 (1971).

    Google Scholar 

  9. A. V. Pechinkin, “A queueing system with absolute priorities,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 6, 62–72 (1983).

    Google Scholar 

  10. S. F. Yashkov, “On the discipline of priority sharing of the server by jobs with minimum completed processing time,” Tekh. Sredstv Svyazi, Ser. ASU, No. 2, 51–62 (1978).

    Google Scholar 

  11. A. V. Pechinkin, “On upper and lower limits of mean queue length in systems with Schrage's discipline,” Tekh. Sredstv Svyazi, Ser. Sistemy Svyazi, No. 3, 24–28 (1980).

    Google Scholar 

  12. A. V. Pechinkin, “On one invariant queueing system,” Math. Operationsforsch, und Statist., Ser. Optimization,14, No. 3, 433–444 (1983).

    Google Scholar 

  13. A. V. Pechinkin, “A system with the first shortest processing time discipline without preemption,” Avtomat. Telemekh., No. 3, 53–61 (1985).

    Google Scholar 

Download references

Authors
  1. A. V. Pechinkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Problemy Ustoichivosti Stokhasticheskikh Modelei — Trudy Seminara, pp. 118–121, 1985.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pechinkin, A.V. Limits on stationary queue length under various service disciplines. J Math Sci 40, 545–548 (1988). https://doi.org/10.1007/BF01083652

Download citation

  • Issue Date:

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

Keywords

Search

Navigation