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 · Study

ArticleShelves

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

R. Schaßberger1983

OA

Articlebronze1983

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

R. Schaßberger · Hans Daduna

58 citations·0/0 files stored·Journal of the ACM

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Probability and Statistical Research Optimization and Search Problems

Abstract

The distnbutlon of the time for a round trip of a job m a cycle of M exponential FIFO queues, where Njobs are cycling, is derived.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 58 citations exist upstream.

References

1973Computational algorithms for closed queueing networks with exponential servers 1957Waiting Times When Queues are in Tandem 1963Note on Queues in Tandem

Cited by

1984The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues 1990Laplace transform inversion and passage-time distributions in Markov processes 1993Estimating the throughput of an exponential CONWIP assembly system 2000PERFORMANCE ANALYSIS OF AN ASSEMBLY STATION WITH INPUT FROM MULTIPLE FABRICATION LINES 1985Technical Note—On Normalizing Constants in Queueing Networks 1990Estimating variance of output from cyclic exponential queueing systems 1983The cyclic queue with one general and one exponential server 1987Sojourn times in queuing networks with multiserver modes

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

1977Queueing Models for Computer Communications System Analysisarticle · 2 shared references 1999Queueing theory in manufacturing: A surveyarticle · 2 shared references 1985Queueing Networks: A Survey of Their Random Processesarticle · 2 shared references 1982Passage times for overtake-free paths in Gordon–Newell networksarticle · 2 shared references 1984The amount of overtaking in a network of queuesarticle · 2 shared references 1993The mathematics of product form queuing networksarticle · 2 shared references

Details

Year1983

Typearticle

Published1983-01-01

VenueJournal of the ACM

ISSN-L0004-5411

Languageen

Citations58

Files0 public / 0

ShelfAdvanced Queuing Theory Analysis

Identifiers

doi10.1145/322358.322369

openalex_workW2012643894

Links

Imported from OpenAlex (CC0) — nothing here is generated.