Scheduling chains to minimize mean flow time

Moshe Dror, Wieslaw Kubiak, Paolo Dell'Olmo

Research output: Contribution to journalArticle

14 Scopus citations

Abstract

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
Volume61
Issue number6
Publication statusPublished - Mar 28 1997

    Fingerprint

Keywords

  • Analysis of algorithms
  • Combinatorial problems
  • Computational complexity

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Dror, M., Kubiak, W., & Dell'Olmo, P. (1997). Scheduling chains to minimize mean flow time. Information Processing Letters, 61(6), 297-301.