### 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 language | English (US) |
---|---|

Pages (from-to) | 320-330 |

Number of pages | 11 |

Journal | Mathematics of Operations Research |

Volume | 2 |

Issue number | 4 |

State | Published - Nov 1977 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

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

### Cite this

*Mathematics of Operations Research*,

*2*(4), 320-330.

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

Research output: Contribution to journal › Article

*Mathematics of Operations Research*, vol. 2, no. 4, pp. 320-330.

}

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 -