Preemptive scheduling to minimize mean weighted flow time

Joseph Y.T. Leung, Gilbert H. Young

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

In this note we show that preemptive scheduling to minimize mean weighted flow time is NP-hard even for a set of equal-length tasks.

Original languageEnglish (US)
Pages (from-to)47-50
Number of pages4
JournalInformation Processing Letters
Volume34
Issue number1
DOIs
StatePublished - Feb 22 1990

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Keywords

  • NP-completeness
  • NP-hardness
  • mean weighted flow time
  • preemptive scheduling

Fingerprint Dive into the research topics of 'Preemptive scheduling to minimize mean weighted flow time'. Together they form a unique fingerprint.

Cite this