1986
DOI: 10.1007/bf01149328
|View full text |Cite
|
Sign up to set email alerts
|

Assembly-like queues with finite capacity: Bounds, asymptotics and approximations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0

Year Published

1997
1997
2012
2012

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 80 publications
(27 citation statements)
references
References 3 publications
0
27
0
Order By: Relevance
“…Approximations for the throughput rate and average queue length were given. Lipper and Sengupta (1986) also extended the work of Latouche by considering multiple Poisson input streams arriving in buffers with a finite capacity. They derived bounds and approximations for Poisson arrivals with the same rate and an arrival is blocked and lost if the buffer is full.…”
Section: Introductionmentioning
confidence: 99%
“…Approximations for the throughput rate and average queue length were given. Lipper and Sengupta (1986) also extended the work of Latouche by considering multiple Poisson input streams arriving in buffers with a finite capacity. They derived bounds and approximations for Poisson arrivals with the same rate and an arrival is blocked and lost if the buffer is full.…”
Section: Introductionmentioning
confidence: 99%
“…Approximations for the throughput rate and average queue length were given. Lipper and Sengupta [17] is another extension of the work of Latouche. In this paper, multiple Poisson input streams arrive in buffers with finite capacity.…”
Section: Introductionmentioning
confidence: 99%
“…These efforts have focused on studying the impact of arrival rates and queue capacities on performance measures such as throughput, synchronization delays, and queue lengths at the different input buffers. However for the sake of analytical tractability, a majority of these efforts assume that the fork/join stations are fed by Poisson inputs (Harrison 1973, Bhat 1986, Lipper and Sengupta 1986, Hopp and Simon 1989, Som et al 1994, Takahashi et al 1996,Varki 1999. Although these results are useful, in many of the applications cited above the input processes are not Poisson.…”
Section: Introductionmentioning
confidence: 99%