Hostname: page-component-7dd5485656-glrdx Total loading time: 0 Render date: 2025-10-30T16:42:16.692Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimality of the shortest line discipline

Published online by Cambridge University Press:  14 July 2016

Wayne Winston
Wayne Winston*
Affiliation:
Indiana University
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider a queuing system consisting of a finite number of identical exponential servers. Each server has its own queue, and upon arrival each customer must be assigned to some server's queue. Under the assumption that no jockeying between queues is permitted, it is shown that the intuitively satisfying rule of assigning each arrival to the shortest line maximizes, with respect to stochastic order, the discounted number of customers to complete their service in any time t.

Keywords

QUEUINGSHORTEST LINESTOCHASTIC ORDERMARKOV DECISION PROCESSES

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 14 , Issue 1 , March 1977 , pp. 181 - 189
Copyright
Copyright © Applied Probability Trust 1977 

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

Bessler, S. and Veinott, A. Jr. (1966) Optimal policy for a dynamic multi-echelon inventory model. Naval Logist. Res. Quart. 13, 355–389.CrossRefGoogle Scholar
Howard, R. (1960) Dynamic Programming and Markov Processes. M.I.T. Press, Cambridge, Mass.Google Scholar
Lippman, S. A. (1975) Applying a new technique in the optimization of exponential queuing systems. Operat. Res. 23, 687–710.Google Scholar
Miller, B. (1968) Finite state continuous time Markov decision processes with an infinite planning horizon. SIAM J. Control. 6, 266–380.CrossRefGoogle Scholar
Ross, S. M. (1970) Applied Probability Models with Optimization Applications. Holden–Day, San Francisco.Google Scholar
Stidham, S. Jr. (1970) On the optimality of single server queuing systems. Operat. Res. 18, 708–732.CrossRefGoogle Scholar
Whitt, W. (1975) Continuity of Markov processes and dynamic programs. Technical Report, Yale University, New Haven.Google Scholar
Yu, O. (1974) Stochastic bounds for heterogeneous-server queues with Erlang service times. J. Appl. Prob. 11, 785–796.Google Scholar