Hostname: page-component-848d4c4894-x5gtn Total loading time: 0 Render date: 2024-05-05T11:53:40.590Z Has data issue: false hasContentIssue false
  • English
  • Français

Multiserver scheduling of jobs with increasing completion rates

Published online by Cambridge University Press:  14 July 2016

J. C. Gittins
J. C. Gittins*
Affiliation:
Keble College, Oxford
*
∗Postal address: Mathematical Institute, University of Oxford, 24–29 St Giles, Oxford OX1 3LB, U.K.
Get access Rights & Permissions [Opens in a new window]

Abstract

Under certain conditions it is shown that for jobs with increasing completion rates the expected flow time is minimised by a non-pre-emptive service discipline.

Keywords

FLOW TIMEHAZARD RATESTOCHASTIC SCHEDULING
Type
Short Communications
Information
Journal of Applied Probability , Volume 18 , Issue 1 , March 1981 , pp. 321 - 324
Copyright
Copyright © Applied Probability Trust 

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

Barlow, R. E. and Proschan, F. (1975) Statistical Theory of Reliability and Life Testing. Holt, Rinehart and Winston.Google Scholar
Gittins, J. C. (1972) Some problems of stochastic resource allocation. J. Appl. Prob. 9, 360–369.CrossRefGoogle Scholar
Glazebrook, K. D. (1979) Scheduling tasks with exponential service times on many parallel processors. J. Appl. Prob. 16, 685–689.CrossRefGoogle Scholar
Kiefer, J. and Wolwowitz, J. (1955) On the theory of queues with many servers. Trans. Amer. Math. Soc. 78, 1–18.Google Scholar
Weber, R. R. (1979) Optimal Organisation of Multi-Server Systems. Ph.D. Dissertation, Cambridge University.Google Scholar