Chapter2003

Two-Moment Approximations for Throughput and Mean Queue Length of a Fork/Join Station with General Inputs from Finite Populations

Ananth Krishnamurthy · Rajan Suri · Mary K. Vernon

15 citations0/0 files storedInternational series in management science/operations research/International series in operations research & management science

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 Petri Nets in System Modeling Age of Information Optimization

Abstract

No abstract was published for this record.

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 — 15 citations exist upstream.

References

1983The Queueing Network Analyzer 1982Approximating a Point Process by a Renewal Process, I: Two Basic Methods 1979Approximate Analysis of General Queuing Networks by Decomposition 1993APPROXIMATIONS FOR THE GI/G/m QUEUE 1968Some Inequalities in Queuing 1973Assembly-like queues 1984Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues 1989Acyclic fork-join queuing networks

Cited by

2011Performance analysis of CONWIP systems with batch size constraints

Explore the map →

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

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