Monotonicity of the throughput in single server production and assembly networks with respect to the buffer sizes

Ivo Adan · van der J Jan Wal

26 citations0/0 files storedTU/e Research Portal

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 Scheduling and Optimization Algorithms Petri Nets in System Modeling

Abstract

The throughput in single server production and assembly networks is shown to be monotone in the size of the local buffers. The proof is based on sample path comparison.

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

References

1985A Concept of Monotonicity and Its Characterization for Closed Queueing Networks 1987Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks 1985Some properties of the throughput function of closed networks of queues

Cited by

2008Effective process times for multi-server flowlines with finite buffers 2017Analysis of tandem queues with finite buffer capacity 2010Error Bounds and Comparison Results: The Markov Reward Approach For Queueing Networks

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.