Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-28T07:00:51.939Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal scheduling in queueing networks

Published online by Cambridge University Press:  01 July 2016

F. J. Massey III  and
D. F. Miller
F. J. Massey III
Affiliation:
University of Michigan-Dearborn
D. F. Miller
Affiliation:
Wright State University
Get access Rights & Permissions [Opens in a new window]

Extract

This paper derives an algorithm for finding a scheduling discipline for scheduling N customers at M service stations in a closed queueing network so as to optimize a performance measure which depends on the configuration of customers at the service stations.

Type
Applied Probability in Biology and Engineering. An ORSA/TIMS Special Interest Meeting
Information
Advances in Applied Probability , Volume 16 , Issue 1 , March 1984 , pp. 13
Copyright
Copyright © Applied Probability Trust 1984 

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.)

References

Miller, B. L.(1968) Finite state continuous time Markov decision process with an infinite planning horizon. J. Math, Anal. Appl. 22, 552–569.CrossRefGoogle Scholar