Convexity properties of the overflow in an ordered-entry system with heterogeneous servers

DOI10.1016/0167-6377(86)90087-8zbMath0614.90038OpenAlexW2094657923MaRDI QIDQ1820673

David D. W. Yao

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90087-8

zbMATH Keywords

convexityheterogeneous serversoverflow probabilitiesserver allocationGI/M/m loss systemordered entryoverflow system

Mathematics Subject Classification ID

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

Related Items (8)

Stationary Blocking Probability in Multi-server Finite Queuing System with Ordered Entry and Poisson Arrivals ⋮ Analysis and optimization of systems with heterogeneous servers and jump priorities ⋮ Delay-Minimizing Capacity Allocation in an Infinite Server-Queueing System ⋮ Analyzing the models of systems with heterogeneous servers ⋮ On the convexity of loss probabilities when arrivals occur in batches and servers are heterogeneous ⋮ Analysis of \(GI/ M/ n/ n\) queueing system with ordered entry and no waiting line ⋮ Design of manufacturing systems using queueing models ⋮ Loss probability properties in retrial queues

Cites Work

• Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers
• The Arrangement of Servers in an Ordered-Entry System
• Unnamed Item

This page was built for publication: Convexity properties of the overflow in an ordered-entry system with heterogeneous servers