| Article ID: | iaor20001550 |
| Country: | Germany |
| Volume: | 49 |
| Issue: | 2 |
| Start Page Number: | 211 |
| End Page Number: | 219 |
| Publication Date: | Jan 1999 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Kubiak W., Brucker Peter, Hurink Johann |
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.