Article contents
A note on the GI/M/1 queue with Poisson negative arrivals
Published online by Cambridge University Press: 14 July 2016
Abstract
An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS0021900200019276/resource/name/firstPage-S0021900200019276a.jpg)
- Type
- Letters to the Editor
- Information
- Copyright
- Copyright © by the Applied Probability Trust 2001
References
El-taha, M. and Stidham, S. Jr. (1999). Sample-Path Analysis of Queueing Systems. Kluwer, Boston.Google Scholar
Harrison, P. G., and Pitel, E. (1993). Sojourn times in single server queues with negative customers. J. Appl. Prob.
30, 943–963.CrossRefGoogle Scholar
Harrison, P. G., and Pitel, E. (1996). The M/G/1 queue with negative customers. Adv. Appl. Prob.
28, 540–566.CrossRefGoogle Scholar
Jain, G., and Sigman, K. (1996). A Pollaczek–Khinchine formula for M/G/1 queues with disasters. J. Appl. Prob.
33, 1191–1200.CrossRefGoogle Scholar
Wolff, R. W. (1982). Poisson arrivals see time averages. Operat. Res.
30, 223–231.CrossRefGoogle Scholar
Wolff, R. W. (1989). Stochastic Modeling and the Theory of Queues. Prentice-Hall, Englewood Cliffs, NJ.Google Scholar
Yang, W. S., and Chae, K. C. (1998). The GI/M/1 queue with negative customers. Tech. Rep., Department of Industrial Engineering, KAIST. Available at http://osl7.kaist.ac.kr/lab/papers_e.htm.Google Scholar
- 12
- Cited by