The interchangeability of ·/M/1 queues in series

DOI10.2307/3213100zbMath0417.60091OpenAlexW4239883823MaRDI QIDQ3207868

Richard R. Weber

Publication date: 1979

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3213100

zbMATH Keywords

tandem queuesdeparture processesoutput processesseries of queues

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Related Items (16)

Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity ⋮ ON STATE-INDEPENDENT IMPORTANCE SAMPLING FOR THE GI|GI|1 TANDEM QUEUE¹ ⋮ Optimal order for two servers in tandem ⋮ Probabilistic proof of the interchangeability of ./M/1 queues in series ⋮ On the order of tandem queues ⋮ Batch latency analysis and phase transitions for a tandem of queues with exponentially distributed service times ⋮ A heuristic for determining the optimal order in a tandem queue ⋮ Dynamic importance sampling for queueing networks ⋮ Ordering of Tandem Constant-Service Stations to Minimize In-Process Stock Cost ⋮ Queues, stores, and tableaux ⋮ Branch and Bound Algorithm for Ordering of Tandem Constant-Service Stations ⋮ Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops ⋮ On the Interchangeability and Stochastic Ordering of Exponential Queues in Tandem with Blocking ⋮ Bowl Shapes Are Better with Buffers–Sometimes ⋮ Optimal Order for Servers in Series with No Queue Capacity ⋮ Approximations for departure processes and queues in series

This page was built for publication: The interchangeability of ·/M/1 queues in series