Skip to main content
×
×
Home

On the optimal assignment of customers to parallel servers

  • Richard R. Weber (a1)
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.

Copyright
References
Hide All
Glazebrook, K. D. and Nash, P. (1976) On multi-server stochastic scheduling. J. R. Statist. Soc. B 38, 6772.
Weber, R. R. and Nash, P. (1978) An optimal strategy in multi-server stochastic scheduling. To appear.
Winston, W. (1977) Optimality of the shortest line discipline. J. Appl. Prob. 14, 181189.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Applied Probability
  • ISSN: 0021-9002
  • EISSN: 1475-6072
  • URL: /core/journals/journal-of-applied-probability
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed