Name
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. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/s001860050021 | Math. Meth. of OR |
Keywords | Field | DocType |
scheduling,chain precedence constraints,identical jobs,uniform machines,linear time | Mathematical optimization,Job shop scheduling,Scheduling (computing),Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
49 | 2 | 1432-2994 |
Citations | PageRank | References |
20 | 1.41 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Brucker | 1 | 810 | 87.77 |
| Johann Hurink | 2 | 422 | 42.84 |
| Wieslaw Kubiak | 3 | 540 | 62.61 |