SCHEDULING OF STOCHASTIC TASKS ON TWO PARALLEL PROCESSORS.

Michael Pinedo, Gideon Weiss

Research output: Contribution to journalArticlepeer-review

Abstract

The paper considers the problem of scheduling n tasks on two identical parallel processors. It shows both in the case when the processing times for the n tasks are independent exponential random variables, and when they are independent hyperexponentials which are mixtures of two fixed exponentials, that the policy of performing tasks with longest expected processing time (LEPT) first minimizes the expected makespan, and that in the hyperexponential case the policy of performing tasks with shortest expected processing time (SEPT) first minimizes the expected flow time. The approach is simpler than the dynamic programming approach recently employed by J. Bruno and P. Downey.

Original languageEnglish
Pages (from-to)527-535
Number of pages9
JournalNaval Research Logistics Quarterly
Volume26
Issue number3
DOIs
StatePublished - 1979

ASJC Scopus subject areas

  • Engineering (all)

Fingerprint

Dive into the research topics of 'SCHEDULING OF STOCHASTIC TASKS ON TWO PARALLEL PROCESSORS.'. Together they form a unique fingerprint.

Cite this