Bounding the performance of tandem queues with finite buffer spaces
- 1 April 1994
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 48 (2) , 185-195
- https://doi.org/10.1007/bf02024664
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Simple Bounds for Finite Single-Server Exponential Tandem QueuesOperations Research, 1988
- An Approximate Model of Multistage Automatic Transfer Lines with Possible Scrapping Of WorkpiecesIIE Transactions, 1987
- The preservation of likelihood ratio ordering under convolutionStochastic Processes and their Applications, 1986
- Approximate analysis of exponential tandem queues with blockingEuropean Journal of Operational Research, 1982
- A Note On Transfer Lines With Unreliable Machines, Random Processing Times, and Finite BuffersA I I E Transactions, 1982
- Approximate analysis of exponential queueing systems with blockingActa Informatica, 1980
- Markov Chain Models — Rarity and ExponentialityPublished by Springer Nature ,1979