Queues with heterogeneous servers and uninformed customers: who works the most?

2007/06/04 by Fabricio B. Cabral, Fabricio Bandeira Cabral, Cabral, Fabricio Bandeira
Business, Management and Accounting · Computer Science · Engineering · Mathematics · #Advanced Queuing Theory Analysis #Advanced Wireless Network Optimization #FOS: Mathematics #Network Traffic and Congestion Control #Probability (math.PR) #math.PR

paper · pdf · doi:10.48550/arxiv.0706.0560

arxiv created 2007/06/04 · openalex publication_date 2007/06/04 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we consider systems that can be modelled by M | M | n queues with heterogeneous servers and non informed customers. Considering any two servers: we show that the probability that the fastest server is busy is smaller than the probability that the slowest server is busy. Moreover, we show that the effective rate of service done by the fastest server is larger than effective rate of service done by the slowest server.

Related

• Analyzing homogenous and heterogeneous multi-server queues via neural networks
• MATHEMATICAL ANALYSIS OF PERFORMANCE MEASURES OF M/M/1 QUEUE MODELS.
• Learning Unknown Service Rates in Queues: A Multi-Armed Bandit Approach
• Two Unordered Queues
• Many Server Queueing Models with Heterogeneous Servers and Parameter Uncertainty with Customer Contact Centre Applications