Scheduling chains to minimize mean flow time

Moshe Dror, Wieslaw Kubiak, Paolo Dell'Olmo

Research output: Contribution to journalArticlepeer-review

14 Scopus citations


In this note we consider the chain precedence relation in scheduling and distinguish between strong chains and weak chains. We prove that for two identical parallel processors the mean flow time problem with strong chains can be solved in polynomial time whereas for weak chains the same problem is NP-hard in the strong sense.

Original languageEnglish (US)
Pages (from-to)297-301
Number of pages5
JournalInformation Processing Letters
Issue number6
StatePublished - Mar 28 1997


  • Analysis of algorithms
  • Combinatorial problems
  • Computational complexity

ASJC Scopus subject areas

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


Dive into the research topics of 'Scheduling chains to minimize mean flow time'. Together they form a unique fingerprint.

Cite this