Multiserver scheduling of jobs with increasing completion rates
Author:
- J. C. GittinsJGJ. C. Gittins
- 1 March 1981
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 18 (1) , 321-324
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
This publication has 3 references indexed in Scilit:
- Scheduling tasks with exponential service times on parallel processorsJournal of Applied Probability, 1979
- Some problems of stochastic resource allocationJournal of Applied Probability, 1972
- On the theory of queues with many serversTransactions of the American Mathematical Society, 1955