Approximation results in parallel machnies stochastic scheduling

Research output: Contribution to journalArticlepeer-review


We consider scheduling a batch of jobs with stochastic processing times on parallel machines. We derive various new formulae for the expected flowtime and weighted flowtime under general scheduling rules. Smith's Rule, which orders job starts by decreasing ratio of weight to expected processing time provides a natural heuristic for this problem. We obtain a bound on the worst case difference between the expected weighted flow time under Smith's Rule and under an optimal policy. For a wide class of processing time distributions, this bound is of oder O(1) and does not increase with the number of jobs.

Original languageEnglish
Pages (from-to)195-242
Number of pages48
JournalAnnals of Operations Research
Issue number1
StatePublished - Dec 1990
Externally publishedYes

ASJC Scopus subject areas

  • General Decision Sciences
  • Management Science and Operations Research


Dive into the research topics of 'Approximation results in parallel machnies stochastic scheduling'. Together they form a unique fingerprint.

Cite this