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)|
|Number of pages||11|
|Journal||Mathematics of Operations Research|
|Publication status||Published - Nov 1977|
ASJC Scopus subject areas
- Management Science and Operations Research
- Applied Mathematics