NP-complete scheduling problems
β
J.D. Ullman
π
Article
π
1975
π
Elsevier Science
π
English
β 423 KB
We show that the problem of finding an optimal schedule for a set of jobs is NPcomplete even in the following two restricted cases. (1) All jobs require one time unit. (2) All jobs require one or two time units, and there are only two processor resolving (in the negative a conjecture of R. L. Grah