Article contents
A new approach to the G/G/1 queue with generalized setup time and exhaustive service
Published online by Cambridge University Press: 14 July 2016
Abstract
We consider a class of G/G/1 queueing models with independent generalized setup time and exhaustive service. It is shown that a variety of single-server queueing systems with service interruption are special cases of our model. We give a simple computational scheme for the moments of the stationary waiting time and sojourn time. Our numerical investigations indicate that the algorithm is quite accurate and fast in general. For the M/G/1 case, we are able to derive a recursive formula for the moments of the stationary waiting time, which includes the Takács formula as a special case. It immediately results in the stochastic decompòsition property which can be found in the literature.
- Type
- Research Article
- Information
- Copyright
- Copyright © Applied Probability Trust 1994
References
- 5
- Cited by