Effective upper bounds for expected cycle times in tandem queues with communication blocking

Authors
Nakade, K
Citation
K. Nakade, Effective upper bounds for expected cycle times in tandem queues with communication blocking, PROB ENG I, 15(3), 2001, pp. 327-334
Citations number
7
Categorie Soggetti
Engineering Mathematics
Journal title
PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES
ISSN journal
02699648 → ACNP
Volume
15
Issue
3
Year of publication
2001
Pages
327 - 334
Database
ISI
SICI code
0269-9648(2001)15:3<327:EUBFEC>2.0.ZU;2-R
Abstract
Tandem queues with finite buffers have been widely discussed as basic model s of communication and manufacturing systems. The cycle time is the importa nt measure in such systems, In this article, we consider finite tandem queu es with communication blocking and general service-time distributions. We i ntroduce an order on pairs of random variable sets to give effective upper bounds for the expected cycle times.