论文信息 - ON A ROUTING PROBLEM

ON A ROUTING PROBLEM

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.

T. Lindvall

[1] N. L. Lawrie,et al. Comparison Methods for Queues and Other Stochastic Models , 1984 .

[2] Ward Whitt,et al. Comparison methods for queues and other stochastic models , 1986 .

[3] A. W. Kemp,et al. Applied Probability and Queues , 1989 .

[4] Ronald W. Wolff,et al. Stochastic Modeling and the Theory of Queues , 1989 .

[5] T. Lindvall. Lectures on the Coupling Method , 1992 .

[6] Christos G. Cassandras,et al. Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates , 1993, Journal of Applied Probability.

[7] Peter Winkler. Optimality and Greed in Dynamic Allocation , 2001, J. Algorithms.

[8] T. Lindvall. COMPARISONS BETWEEN CERTAIN QUEUING SYSTEMS , 2002, Probability in the Engineering and Informational Sciences.