Scheduling tasks with exponential service times on parallel processors
- 1 June 1979
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 16 (03) , 685-689
- https://doi.org/10.1017/s0021900200107843
Abstract
We consider the problem of how to schedule n tasks 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 1 reference indexed in Scilit:
- On the optimal assignment of customers to parallel serversJournal of Applied Probability, 1978