On the public citation graph

A decomposition-related throughput property of tandem queueing networks with blocking

https://doi.org/10.1007/bf01149261
0 signed · 22 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01158549openalex-snapshot
Bounds and heuristics for assembly-like queues
inferredcites →https://doi.org/10.1007/bf02024664openalex-snapshot
Bounding the performance of tandem queues with finite buffer spaces
inferredcites →https://doi.org/10.1016/0167-6377(86)90067-2openalex-snapshot
On equivalencies of blocking mechanisms in queueing networks with blocking
inferredcites →https://doi.org/10.1016/0377-2217(84)90049-3openalex-snapshot
Stochastic processes and their network representations associated with a production line queuing model
inferredcites →https://doi.org/10.1017/s0021900200025559openalex-snapshot
Stability of finite queue, tandem server systems
inferredcites →https://doi.org/10.1017/s0021900200041863openalex-snapshot
Monotonicity of throughput in non-Markovian networks
inferredcites →https://doi.org/10.1080/00207548708919865openalex-snapshot
Estimation of line efficiency by aggregation
inferredcites →https://doi.org/10.1080/07408178708975416openalex-snapshot
Matrix-geometric and Recursive Algorithm Solution of a Two-stage Unreliable How Line
inferredcites →https://doi.org/10.1109/robot.1987.1087826openalex-snapshot
An aggregation method for performance evaluation of transfer lines with unreliable machines and finite buffers
inferredcites →https://doi.org/10.1145/1041823.1041824openalex-snapshot
Queueing networks with blocking
inferredcites →https://doi.org/10.1287/mnsc.11.5.553openalex-snapshot
A Sequence of Two Servers with No Intermediate Queue
inferredcites →https://doi.org/10.1287/opre.15.2.286openalex-snapshot
Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
inferredcites →https://doi.org/10.1287/opre.35.2.291openalex-snapshot
An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4758285openalex-extracted
A Survey on the Tandem Queuing Models
inferred← citeshttps://doi.org/10.1007/978-1-4615-0373-6_2openalex-snapshot
Publications of John A. Buzacott
inferred← citeshttps://doi.org/10.1007/978-1-4757-3345-7_6openalex-snapshot
Approximate and Bound Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4757-3345-7_7openalex-snapshot
Equivalence, Insensitivity and Monotonicity Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-39408-9_28openalex-snapshot
A Tight Bound on the Throughput of Queueing Networks with Blocking
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00378-9openalex-snapshot
Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
inferred← citeshttps://doi.org/10.1016/s0166-5316(02)00089-5openalex-snapshot
Queueing networks with blocking
inferred← citeshttps://doi.org/10.18500/1816-9791-2013-13-2-2-14-20openalex-snapshot
Identification of a State Machine Structure with Finites Fragment of Behavior
inferred← citeshttps://doi.org/10.18500/1816-9791-2013-13-2-2-20-31openalex-snapshot
Queueing Networks with Batch Movements of Customers, Blocking and Clusters
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.