Comparing ordered-entry queues with heterogeneous servers

DOI10.1007/BF01158900zbMath0666.60099MaRDI QIDQ1116560

J. George Shanthikumar, David D. W. Yao

Publication date: 1987

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

finite bufferpoint processcomparison of queuesqueues with ordered entrysample path comparison

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (10)

A duality approach to admission and scheduling controls of queues ⋮ Markovian queueing systems with retrials and heterogeneous servers ⋮ Stationary Blocking Probability in Multi-server Finite Queuing System with Ordered Entry and Poisson Arrivals ⋮ Optimality of the fastest available server policy ⋮ Many-server scaling of the N-system under FCFS-ALIS ⋮ On the convexity of loss probabilities when arrivals occur in batches and servers are heterogeneous ⋮ Design of manufacturing systems using queueing models ⋮ A model of channel allocation in multichannel local networks ⋮ Performance-based routing ⋮ Dynamic routing in large-scale service systems with heterogeneous servers

Cites Work

• Unnamed Item
• Stochastic inequalities on partially ordered spaces
• Partial orderings of permutations and monotonicity of a rank correlation statistic
• A note on many-server queueing systems with ordered entry, with an application to conveyor theory
• On the comparison of point processes
• Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers
• Comparing counting processes and queues
• Comparing multi-server queues with finite waiting rooms, I: Same number of servers
• Inequalities: theory of majorization and its applications

This page was built for publication: Comparing ordered-entry queues with heterogeneous servers