Brucker, Peter; Hurink, Johann; Knust, Sigrid - In: Computational Statistics 56 (2003) 3, pp. 407-412
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs with unit processing times, release dates and outtree precedence relations has to be processed on parallel identical machines such that the total completion time ∑ C j is...