112 search results - page 7 / 23 » Bi-objective Optimization: An Online Algorithm for Job Assig... |
105
click to vote
APPROX
2000
Springer
15 years 4 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
111
click to vote
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
ICDCS
2008
IEEE
15 years 6 months ago
2008
IEEE
As distributed real-time applications gain in popularity, a key challenge is to allocate resources so that diverse realtime requirements (including non-real-time applications), di...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
TALG
2010
14 years 10 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...