Abstract
We consider a queuing system with several identical servers, each with its own queue. Identical customers arrive according to some stochastic process and as each customer arrives it must be assigned to some server's queue. No jockeying amongst the queues is allowed. We are interested in assigning the arriving customers so as to maximize the number of customers which complete their service by a certain time. If each customer's service time is a random variable with a non-decreasing hazard rate then the strategy which does this is one which assigns each arrival to the shortest queue.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
254 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Queue-length-aware dispatching in large-scale heterogeneous systems;Queueing Systems;2024-08-03
2. A Study Comparing Waiting Times in Global and Local Queuing Systems with Heterogeneous Workers;Applied Sciences;2024-04-29
3. Heavy-Traffic Optimal Size- and State-Aware Dispatching;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2024-02-16
4. Analysis of Fork-Join Scheduling on Heterogeneous Parallel Servers;IEEE/ACM Transactions on Networking;2024
5. The Power of Two Choices with Load Comparison Errors;Proceedings of the Twenty-fourth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing;2023-10-16