Hostname: page-component-89b8bd64d-b5k59 Total loading time: 0 Render date: 2026-05-08T00:46:03.756Z Has data issue: false hasContentIssue false
  • English
  • Français

ON A ROUTING PROBLEM

Published online by Cambridge University Press:  01 July 2004

Torgny Lindvall
Torgny Lindvall
Affiliation:
School of Mathematical Sciences, University of Göteborg, 412 96 Göteborg, Sweden, E-mail: lindvall@math.chalmers.se
Get access Rights & Permissions [Opens in a new window]

Abstract

In a system with one queue and several service stations, it is a natural principle to route a customer to the idle station with the distributionwise shortest service time. For the case with exponentially distributed service times, we use a coupling to give strong support to that principle. We also treat another topic. A modified version of our methods brings support to the design principle: It is better with few but quick servers.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 18 , Issue 3 , July 2004 , pp. 329 - 337
Copyright
© 2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

Asmussen, S. (1987). Applied probability and queues. Chichester: Wiley.
Lindvall, T. (2002). Lectures on the coupling method. Mineola, NY: Dover.
Lindvall, T. (2002). Comparisons between certain queuing systems. Probability in the Engineering and Informational Sciences 16: 1–17.Google Scholar
Sparaggis, P.D., Towsley, D., & Cassandras, C.G. (1993). Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates. Journal of Applied Probability 30: 223–236.Google Scholar
Stoyan, D. (1983). Comparison methods for queues and other stochastic models. Chichester: Wiley.
Winkler, P. (2001). Optimality and greed in dynamic allocation. Journal of Algorithms 41(2): 244–261.Google Scholar
Wolff, R.W. (1989). Stochastic modeling and the theory of queues. Englewood Cliffs, NJ: Prentice- Hall.