ON THE COMPLEXITY OF MEAN FLOW TIME SCHEDULING.

Research output: Contribution to journalArticle

33 Citations (Scopus)

Abstract

There are n tasks to be scheduled for processing on a set of identical parallel machines. When tasks can be processed in any order, optimal schedules can be constructed in O(n log n) time on any number of identical machines. With arbitrary precedence constraints the problem becomes NP-complete even on one machine. However, for series-parallel precedence constraints an O(n log n) algorithm is known for one machine. It is shown that on two or more machines, the problem is NP-complete even if the precedence constraints are tree-like.

Original languageEnglish (US)
Pages (from-to)320-330
Number of pages11
JournalMathematics of Operations Research
Volume2
Issue number4
StatePublished - Nov 1977
Externally publishedYes

Fingerprint

Precedence Constraints
Flow Time
Computational complexity
Scheduling
NP-complete problem
Identical Parallel Machines
Schedule
Processing
Series
Arbitrary
Flow time
NP-complete

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Mathematics(all)
  • Applied Mathematics

Cite this

ON THE COMPLEXITY OF MEAN FLOW TIME SCHEDULING. / Sethi, Ravi.

In: Mathematics of Operations Research, Vol. 2, No. 4, 11.1977, p. 320-330.

Research output: Contribution to journalArticle

@article{f2df424d9aaf474d987f6c1c5e088119,
title = "ON THE COMPLEXITY OF MEAN FLOW TIME SCHEDULING.",
abstract = "There are n tasks to be scheduled for processing on a set of identical parallel machines. When tasks can be processed in any order, optimal schedules can be constructed in O(n log n) time on any number of identical machines. With arbitrary precedence constraints the problem becomes NP-complete even on one machine. However, for series-parallel precedence constraints an O(n log n) algorithm is known for one machine. It is shown that on two or more machines, the problem is NP-complete even if the precedence constraints are tree-like.",
author = "Ravi Sethi",
year = "1977",
month = "11",
language = "English (US)",
volume = "2",
pages = "320--330",
journal = "Mathematics of Operations Research",
issn = "0364-765X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "4",

}

TY - JOUR

T1 - ON THE COMPLEXITY OF MEAN FLOW TIME SCHEDULING.

AU - Sethi, Ravi

PY - 1977/11

Y1 - 1977/11

N2 - There are n tasks to be scheduled for processing on a set of identical parallel machines. When tasks can be processed in any order, optimal schedules can be constructed in O(n log n) time on any number of identical machines. With arbitrary precedence constraints the problem becomes NP-complete even on one machine. However, for series-parallel precedence constraints an O(n log n) algorithm is known for one machine. It is shown that on two or more machines, the problem is NP-complete even if the precedence constraints are tree-like.

AB - There are n tasks to be scheduled for processing on a set of identical parallel machines. When tasks can be processed in any order, optimal schedules can be constructed in O(n log n) time on any number of identical machines. With arbitrary precedence constraints the problem becomes NP-complete even on one machine. However, for series-parallel precedence constraints an O(n log n) algorithm is known for one machine. It is shown that on two or more machines, the problem is NP-complete even if the precedence constraints are tree-like.

UR - http://www.scopus.com/inward/record.url?scp=0017558373&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0017558373&partnerID=8YFLogxK

M3 - Article

VL - 2

SP - 320

EP - 330

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

SN - 0364-765X

IS - 4

ER -