Stochastic comparisons for single-server queues

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(198708)34:4<555::AID-NAV3220340408>3.0.CO;2-7" /><555::AID-NAV3220340408>3.0.CO;2-7 10.1002/1520-6750(198708)34:4<555::AID-NAV3220340408>3.0.CO;2-7zbMath0651.60092OpenAlexW1966364208MaRDI QIDQ3796508

N. U. Prabhu, Carl M. Harris

Publication date: 1987

Full work available at URL: https://doi.org/10.1002/1520-6750(198708)34:4<555::aid-nav3220340408>3.0.co;2-7

zbMATH Keywords

steady statestochastic comparisonscomparisons of idle timessingle-server queueing sytems

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (3)

An approximation method for a single server queue with cyclically indexed arrival and service rates ⋮ Stochastic comparisons for bulk queues ⋮ A comparison of stochastically ordered queues

Cites Work

• Unnamed Item

This page was built for publication: Stochastic comparisons for single-server queues