Reduction Methods for Tandem Queuing Systems

DOI10.1287/opre.13.1.121zbMath0143.40702OpenAlexW2025109235MaRDI QIDQ5519652

H. D. Friedman

Publication date: 1965

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

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

zbMATH Keywords

probability theory

Related Items (21)

Optimal order for two servers in tandem ⋮ Dependence among single stations in series and its applications in productivity improvement ⋮ On the order of tandem queues ⋮ An aggregation procedure for simulating manufacturing flow line models ⋮ Taylor series expansions for Poisson-driven (max,+)-linear systems ⋮ Performance evaluation for general queueing networks in manufacturing systems: characterizing the trade-off between queue time and utilization ⋮ Constant time per edge is optimal on rooted tree networks ⋮ 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 ⋮ Reduction of a polling network to a single node ⋮ A review of open queueing network models of manufacturing systems ⋮ Queueing theory ⋮ Path delays in communication networks ⋮ Sample-path large deviations for tandem and priority queues with Gaussian inputs ⋮ A study of queueing networks with deterministic service and application to computer networks ⋮ Ordering of Tandem Constant-Service Stations to Minimize In-Process Stock Cost ⋮ Asymptotic analysis of Lévy-driven tandem queues ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ Analysis of an open tandem queueing network with population constraint and constant service times ⋮ Branch and Bound Algorithm for Ordering of Tandem Constant-Service Stations ⋮ Stationary queuing systems with dependencies

This page was built for publication: Reduction Methods for Tandem Queuing Systems