Abstract
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.
Original language | Undefined |
---|---|
Article number | 10.1007/s001860050021 |
Pages (from-to) | 211-219 |
Number of pages | 9 |
Journal | Mathematical methods of operations research |
Volume | 49 |
Issue number | 2 |
DOIs | |
Publication status | Published - Apr 1999 |
Keywords
- IR-63599
- EWI-7628