Narrow search
Showing 1 - 2 of 2
Cover Image
A polynomial algorithm for P | p j=1, r j, outtree | ∑ C j
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...
Persistent link: https://www.econbiz.de/10010847527
Cover Image
A polynomial algorithm for P | p<Subscript>j</Subscript>=1, r<Subscript>j</Subscript>, outtree | ∑ C<Subscript>j</Subscript>
Brucker, Peter; Hurink, Johann; Knust, Sigrid - In: Mathematical Methods of Operations Research 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 <Subscript>j</Subscript> is...</subscript>
Persistent link: https://www.econbiz.de/10010999571