No label defined (Q3780229)
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 4043001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4043001 |
Statements
1982
0 references
efficient and stable algorithms to compute the steady-state probabilities
0 references
delay probability
0 references
moments of the waiting time
0 references
machine repair problem with multiple repairmen
0 references
0.8275205492973328
0 references
0.8058906197547913
0 references
[For the entire collection see Zbl 0636.00014.] We first consider a wide class of single-server queues with state dependent Markovian input including the finite capacity M/G/1 queue and the machine repair problem. We specify efficient and stable algorithms to compute the steady-state probabilities and the moments of the waiting time. Next we discuss the multi-server queue with Poisson input and general service times. We present for the steady-state probabilities good quality approximations to be computed from a stable recursive algorithm. As a by- product we obtain simple approximations for the delay probability and the moments of the waiting time. For the output process we derive tractable and good approximations for the moments of a interdeparture time: Also we discuss extensions to the finite capacity M/G/c queue and the machine repair problem with multiple repairmen having general repair times.
0 references