The \(\mathrm{M}^\theta/\mathrm{G}/1/m\) queues with the time of service, depending on the length of the queue (Q402891)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The M^/G/1/m queues with the time of service, depending on the length of the queue |
scientific article; zbMATH DE number 6335550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(\mathrm{M}^\theta/\mathrm{G}/1/m\) queues with the time of service, depending on the length of the queue |
scientific article; zbMATH DE number 6335550 |
Statements
The \(\mathrm{M}^\theta/\mathrm{G}/1/m\) queues with the time of service, depending on the length of the queue (English)
0 references
28 August 2014
0 references
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.
0 references
batch arrivals
0 references
dependent service time
0 references
stationary queue length distribution
0 references
0.8816730976104736
0 references
0.8602077960968018
0 references
0.8505024313926697
0 references
