Scheduling tasks with exponential service times on parallel processors
Author:
- K. D. GlazebrookKGK. D. Glazebrook
- 1 September 1979
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 16 (3) , 685-689
Abstract
We consider the problem of how to schedulentasks on to several identical processors to meet the objective of minimising the expected flow-time. The strategy which always serves those tasks whose processing-time distributions have the highest hazard rates is shown to be optimal when these distributions are all exponential.Keywords
This publication has 3 references indexed in Scilit:
- An Optimal Strategy in Multi-Server Stochastic SchedulingJournal of the Royal Statistical Society Series B: Statistical Methodology, 1978
- On the optimal assignment of customers to parallel serversJournal of Applied Probability, 1978
- On Multi-Server Stochastic SchedulingJournal of the Royal Statistical Society Series B: Statistical Methodology, 1976