Brucker, Peter; Hurink, Johann; Kubiak, Wieslaw - In: Mathematical Methods of Operations Research 49 (1999) 2, pp. 211-219
The problem of scheduling identical jobs with chain precedence constraints on two uniform machines is considered. It is shown that the corresponding makespan problem can be solved in linear time. Copyright Springer-Verlag Berlin Heidelberg 1999
