| Article ID: | iaor20023521 |
| Country: | United States |
| Volume: | 15 |
| Issue: | 3 |
| Start Page Number: | 327 |
| End Page Number: | 334 |
| Publication Date: | Jan 2001 |
| Journal: | Probability in the Engineering and Informational Sciences |
| Authors: | Nakade K. |
| Keywords: | tandem queues |
Tandem queues with finite buffers have been widely discussed as basic models of communication and manufacturing systems. The cycle time is the important measure in such systems. In this article, we consider finite tandem queues with communication blocking and general service-time distributions. We introduce an order on pairs of random variable sets to give effective upper bounds for the expected cycle times.