On the optimal assignment of servers in a two stations tandem queue with no intermediate waiting room

DOI10.1016/0167-6377(93)90078-UzbMath0771.60076OpenAlexW2048174660MaRDI QIDQ2367034

Esther Frostig

Publication date: 16 August 1993

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

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90078-u

zbMATH Keywords

stochastic orderingblockingconvex orderingoptimal assignmenttandem queueing systemreverse hazard rate ordering

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 ⋮ A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.

Cites Work

• Unnamed Item
• On the optimal order of M machines in tandem
• Properties of duality in tandem queueing systems
• Characterization of optimal order of servers in a tandem queue with blocking
• Bowl Shapes Are Better with Buffers–Sometimes
• Optimal Order of Servers for Tandem Queues in Light Traffic
• A Sequence of Service Stations with Arbitrary Input and Regular Service Times
• A Sequence of Two Servers with No Intermediate Queue

This page was built for publication: On the optimal assignment of servers in a two stations tandem queue with no intermediate waiting room