82 search results - page 6 / 17 » Maximizing Job Completions Online |
ICPP
2008
IEEE
14 years 2 months ago
2008
IEEE
We design an incentive-compatible mechanism for scheduling n non-malleable parallel jobs on a parallel system comprising m identical processors. Each job is owned by a selfish us...
IOR
2010
13 years 6 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
WAOA
2010
Springer
13 years 5 months ago
2010
Springer
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...