Hostname: page-component-745bb68f8f-v2bm5 Total loading time: 0 Render date: 2025-01-14T19:35:59.853Z Has data issue: false hasContentIssue false
  • English
  • Français

Scheduling tasks with exponential service times on parallel processors

Published online by Cambridge University Press:  14 July 2016

K. D. Glazebrook
K. D. Glazebrook*
Affiliation:
University of Newcastle upon Tyne
*
∗ Postal address: Department of Statistics, School of Mathematics, The University of Newcastle upon Tyne, Newcastle upon Tyne NE1 7RU, U.K.
Get access Rights & Permissions [Opens in a new window]

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

FLOW TIMEHAZARD RATESTOCHASTIC SCHEDULING
Type
Short Communications
Information
Journal of Applied Probability , Volume 16 , Issue 3 , September 1979 , pp. 685 - 689
Copyright
Copyright © Applied Probability Trust 1979 

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

Bruno, J. and Downey, P. (1977) Sequencing tasks with exponential service times on two machines. Technical report, Department of Computer Sciences, University of California, Santa Barbara.Google Scholar
Glazebrook, K. D. and Nash, P. (1976) On multi-server stochastic scheduling. J. R. Statist. Soc. B 38, 67–72.Google Scholar
Nash, P. (1973) Optimal Allocation of Resources Between Research Projects. Ph.D. Thesis, Cambridge University.Google Scholar
Weber, R. R. (1978) On the optimal assignment of customers to parallel servers. J Appl. Prob. 15, 406–413.Google Scholar
Weber, R. R. and Nash, P. (1978) An optimal strategy in multi-server stochastic scheduling. To appear.Google Scholar