Loading...
Please wait, while we are loading the content...
Similar Documents
Equivalence of two classical list scheduling algorithms for dependent tasks with release dates and due dates on parallel processors
| Content Provider | Hyper Articles en Ligne (HAL) |
|---|---|
| Author | Hanen, Claire Munier-Kordon, Alix |
| Abstract | In this communication we establish that two algorithms minimizing the maximum lateness of a set of dependent tasks with release and due dates produce similar schedules: the Garey and Johnson and the Leung Palem and Pnueli algorithms. |
| File Format | |
| Language | English |
| Publisher Date | 2012-01-01 |
| Access Restriction | Open |
| Subject Keyword | scheduling release dates due dates list scheduling info Computer Science [cs] |
| Content Type | Text |
| Resource Type | Article |