On the optimal assignment of customers to parallel servers

Richard R. Weber

doi:10.2307/3213411

journal article Jun 01, 1978

On the optimal assignment of customers to parallel servers

Richard R. Weber

Journal of Applied Probability Vol. 15 No. 2 pp. 406-413 · Cambridge University Press (CUP)

View at Publisher Save 10.2307/3213411

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.

Topics

No keywords indexed for this article. Browse by subject →

References

3

[1]

Glazebrook "On multi-server stochastic scheduling" J. R. Statist. Soc. (1976)

[2]

Weber R. R. and Nash P. (1978) An optimal strategy in multi-server stochastic scheduling. To appear. 10.1111/j.2517-6161.1978.tb01045.x

[3]

10.2307/3213271

Cited By

222

Performance Degradation in Parallel-Server Systems

Josu Doncel, Samuli Aalto · 2019

IEEE/ACM Transactions on Networking

Metrics

222

Citations

3

References

Details

Published: Jun 01, 1978
Vol/Issue: 15(2)
Pages: 406-413
License: View

Authors

R

Richard R. Weber

Cite This Article

Richard R. Weber (1978). On the optimal assignment of customers to parallel servers. Journal of Applied Probability, 15(2), 406-413. https://doi.org/10.2307/3213411

On the optimal assignment of customers to parallel servers

You May Also Like