Notes

Queueing systems with probabilistic priorities

Yu. A. Mamatov, E. A. Timofeev

Yaroslavl'

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.

UDC: 65.012.122


Received: 05.03.1984

Bibliographic databases:

• 
•