The M^/G/1/m queues with the time of service, depending on the length of the queue

From MaRDI portal
Publication:402891





An \(\mathrm{M}/\mathrm{G}/1\) system with batch arrivals and service time depending on the queue size at the service initiation is considered. In particular, the mean busy period and the stationary queue size distribution are derived. The case of a (single) switching threshold of service mode is also studied. The author uses the potential method developed by Korolyuk to study random walks.











This page was built for publication: The \(\mathrm{M}^\theta/\mathrm{G}/1/m\) queues with the time of service, depending on the length of the queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402891)