A finite capacity queue with Markovian arrivals and two servers with group services (Q1331383)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 622173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A finite capacity queue with Markovian arrivals and two servers with group services |
scientific article; zbMATH DE number 622173 |
Statements
A finite capacity queue with Markovian arrivals and two servers with group services (English)
0 references
4 October 1994
0 references
The authors consider a finite capacity queueing system in which arrivals occur according to a Markovian arrival process. There are two servers who offer services to customers in groups of varying sizes and the service times are exponentially distributed with different parameters and they depend on the number of customers served. If the number of customers present exceeds a threshold value, the server initiates a new service to all the customers present; otherwise, he waits until the queue length reaches the threshold value. The authors perform a steady-state analysis of various system performance measures, and develop algorithms.
0 references
exponentially distributed service times
0 references
finite capacity queueing system
0 references
Markovian arrival process
0 references
steady-state analysis
0 references
system performance measures
0 references
algorithms
0 references
0.9057888
0 references
0 references
