Heterogeneous-server loss systems with ordered entry: An anomaly

DOI10.1016/0167-6377(89)90021-7zbMath0681.90041OpenAlexW2026097989MaRDI QIDQ1823846

Robert B. Cooper, Sharmila Palakurthi

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90021-7

zbMATH Keywords

heterogeneous serversinsensitivityordered entryindividual versus social optimizationloss system with Poisson arrivals

Mathematics Subject Classification ID

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

Related Items (3)

Optimality of the fastest available server policy ⋮ Delay-Minimizing Capacity Allocation in an Infinite Server-Queueing System ⋮ On the convexity of loss probabilities when arrivals occur in batches and servers are heterogeneous

Cites Work

• Unnamed Item
• The Arrangement of Servers in an Ordered-Entry System
• A proof of simple insensitive bounds for a pure overflow system
• A Single Server Queueing Loss Model with Heterogeneous Arrival and Service
• The M/G/k Blocking System with Heterogeneous Servers
• The Generalized M/G/k Blocking System with Heterogeneous Servers
• An extension of Erlang's loss formula

This page was built for publication: Heterogeneous-server loss systems with ordered entry: An anomaly