Simple Bounds for Finite Single-Server Exponential Tandem Queues

DOI10.1287/opre.36.3.470zbMath0646.60102OpenAlexW2133453757MaRDI QIDQ3790440

Lamond, Bernard F., Nico M. van Dijk

Publication date: 1988

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.36.3.470

zbMATH Keywords

Numerical resultsproduct form systemssingle-server exponential tandem queues

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (20)

Use of queue modelling in the analysis of elective patient treatment governed by a maximum waiting time policy ⋮ A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results ⋮ Buffer allocation for a class of nonlinear stochastic knapsack problems ⋮ Buffer allocation for an integer nonlinear network design problem ⋮ PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS ⋮ Simple bounds and monotonicity results for finite multi-server exponential tandem queues ⋮ Server assignment for multi-stage production systems with finite buffers ⋮ Error bounds on a practical approximation for finite tandem queues ⋮ Batch latency analysis and phase transitions for a tandem of queues with exponentially distributed service times ⋮ Manufacturing flow line systems: A review of models and analytical results ⋮ Performance bounds on multiserver exponential tandem queues with finite buffers ⋮ Erlang loss bounds for OT-ICU systems ⋮ Stochastic Bounds for Queueing Systems with Multiple On–Off Sources ⋮ Unnamed Item ⋮ Simple performance estimates and error bounds for slotted ALOHA loss systems ⋮ New bounds for expected cycle times in tandem queues with blocking ⋮ The M/M/c with critical jobs ⋮ Bounding the performance of tandem queues with finite buffer spaces ⋮ Upper and lower bounds for the waiting time in the symmetric shortest queue system ⋮ Open finite queueing networks with \(M/M/C/K\) parallel servers

This page was built for publication: Simple Bounds for Finite Single-Server Exponential Tandem Queues