Scheduling identical jobs with chain precedence constraints on two uniform machines
Summery: 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.
scientific article; zbMATH DE number 1439901