Optimal order for two servers in tandem

DOI10.1007/BF00773410zbMath0824.60096OpenAlexW2006397693MaRDI QIDQ1895434

Yanyan Li

Publication date: 6 November 1995

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00773410

zbMATH Keywords

tandem queuestochastic orderinglight trafficoptimal orderinfinite buffer capacity

Mathematics Subject Classification ID

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

Related Items (2)

On the order of tandem queues ⋮ Stochastic comparisons for rooted butterfly networks and tree networks, with random environments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inequalities and an approximation formula for the mean delay time in tandem queueing systems
• The interchangeability of ·/M/1 queues in series
• 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
• Optimal Order of Servers for Tandem Queues in Light Traffic
• THE INTERCHANGEABILITY OF THE SOJOURN AND DELAY TIMES IN A GI/M/1→/M/1 (O) QUEUE
• Tandem Queues with Dependent Service Times in Light Traffic
• The Optimal Order of Service in Tandem Queues
• Reduction Methods for Tandem Queuing Systems
• Complementary generating functions for theM^X/GI/1/kandGI/M^y/1/Kqueues and their application to the comparison of loss probabilities

This page was built for publication: Optimal order for two servers in tandem