ESA 2000 European Symposium on Algorithms
 |  |
Wall of Fame | Most Viewed ESA-2000 Paper
ESA
2000
Springer
13 years 8 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 141 | ||
| 2 | | 124 | ||
| 3 | | 122 | ||
| 4 | | 112 | ||
| 5 | | 110 | ||
| 6 | | 110 | ||
| 7 | | 104 | ||
| 8 | | 98 | ||
| 9 | | 96 | ||
| 10 | | 90 | ||
| 11 | | 84 | ||
| 12 | | 75 | ||
| 13 | | 73 |