4 search results - page 1 / 1 » Improved bounds for scheduling conflicting jobs with minsum ... |
74
Voted
TALG
2008
15 years 1 months ago
2008
WAOA
2004
Springer
15 years 6 months ago
2004
Springer
107
click to vote
IPCO
1998
15 years 2 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
118
click to vote
JSSPP
2004
Springer
15 years 6 months ago
2004
Springer
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...