Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

The Time for a Round Trip in a Cycle of Exponential Queues

3 references·14 citing·43 second hop

FromToDepth

this work references cited by second hop

References

1973Computational algorithms for closed queueing networks with exponential servers863 cited
1957Waiting Times When Queues are in Tandem222 cited
1963Note on Queues in Tandem63 cited

Cited by

1984The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues50 cited
1990Laplace transform inversion and passage-time distributions in Markov processes44 cited
1993Estimating the throughput of an exponential CONWIP assembly system43 cited
2000PERFORMANCE ANALYSIS OF AN ASSEMBLY STATION WITH INPUT FROM MULTIPLE FABRICATION LINES42 cited
1985Technical Note—On Normalizing Constants in Queueing Networks39 cited
1990Estimating variance of output from cyclic exponential queueing systems37 cited
1983The cyclic queue with one general and one exponential server30 cited
1987Sojourn times in queuing networks with multiserver modes29 cited
1989On the Cycle Time Distribution in a Two-Stage Cyclic Network with Blocking26 cited
1982On response time and cycle time distributions in a two-stage cyclic queue25 cited
1993Travel and Sojourn Times in Stochastic Networks23 cited
1984Burke's theorem on passage times in Gordon–Newell networks

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

21 cited

1986Computer System Performance Evaluation Using Queueing Network Models15 cited

1986Models of two queues—a few new views15 cited