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.
No takes yet. Share an insight, caveat, or question.
K. D. Glazebrook (1979) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: