Hostname: page-component-78c5997874-t5tsf Total loading time: 0 Render date: 2024-11-10T21:03:59.664Z Has data issue: false hasContentIssue false
  • English
  • Français

Analysis of the control of queues with shortest-processing-time service discipline

Published online by Cambridge University Press:  01 July 2016

J. G. Shanthikumar
J. G. Shanthikumar*
Affiliation:
University of Toronto
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Ninth Conference on Stochastic Processes and their Applications, Evanston, Illinois, 6–10 August 1979
Information
Advances in Applied Probability , Volume 12 , Issue 2 , June 1980 , pp. 310 - 311
Copyright
Copyright © Applied Probability Trust 1980 

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

1. Heyman, D. P. (1968) Optimal operating policies for M/G/1 queueing systems. Operat. Res. 16, 362–382.CrossRefGoogle Scholar
2. Levy, Y. and Yechiali, U. (1975) Utilization of idle time in an M/G/1 queueing system. Management Sci. 22, 202–211.CrossRefGoogle Scholar
3. Shanthikumar, J. G. (1979) Approximate Queueing Models of Dynamic Job Shops. , University of Toronto.Google Scholar
4. Shanthikumar, J. G. (1979) Some analyses in the control of queues using level crossings of regenerative processes. WP 79-002, Dept. of I.E., University of Toronto.Google Scholar
5. Shanthikumar, J. G. and Buzacott, J. A. (1979) The conditional waiting time in an M/G/1 queue with shortest processing time discipline. WP 79-004, Dept. of I.E., University of Toronto.Google Scholar