Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 1985, Issue 9, Pages 159–162 (Mi at7558)  
Notes

Queueing systems with probabilistic priorities

Yu. A. Mamatov, E. A. Timofeev

Yaroslavl'
Full-text PDF (503 kB)
Abstract: For a service system with probabilistic priorities a procedure of finding the stationary probabilities of the system states and mean customer queue lenghts of every class is described.

Received: 05.03.1984
Bibliographic databases:
Document Type: Article
UDC: 65.012.122
Language: Russian
Citation: Yu. A. Mamatov, E. A. Timofeev, “Queueing systems with probabilistic priorities”, Avtomat. i Telemekh., 1985, no. 9, 159–162
Citation in format AMSBIB
\Bibitem{MamTim85}
\by Yu.~A.~Mamatov, E.~A.~Timofeev
\paper Queueing systems with probabilistic priorities
\jour Avtomat. i Telemekh.
\yr 1985
\issue 9
\pages 159--162
\mathnet{http://mi.mathnet.ru/at7558}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=809672}
\zmath{https://zbmath.org/?q=an:0591.90033}
Linking options:
  • https://www.mathnet.ru/eng/at7558
  • https://www.mathnet.ru/eng/at/y1985/i9/p159
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024