Preemptive scheduling of equal length jobs on two machines to minimize mean flow time

Lee A. Herrbach, Joseph Y.T. Leung

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

We give an O(n log n) time algorithm to preemptively schedule n equal-length jobs with release times on two identical, parallel machines so as to minimize the mean flow time. The complexity of the general problem of minimizing the mean weighted flow time is also reviewed, both for nonpreemptive and preemptive scheduling.

Original languageEnglish (US)
Pages (from-to)487-494
Number of pages8
JournalOperations Research
Volume38
Issue number3
DOIs
StatePublished - Jan 1 1990
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'Preemptive scheduling of equal length jobs on two machines to minimize mean flow time'. Together they form a unique fingerprint.

Cite this