2714 search results - page 53 / 543 » Approximation Schemes for Scheduling |
112
click to vote
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
94
Voted
RTCSA
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
82
Voted
ICC
2009
IEEE
14 years 10 months ago
2009
IEEE
Abstract This paper proposes an analytical method to evaluate the delay violation probability of traffic flows with statistical Quality-of-Service (QoS) guarantees in a Generalize...
107
click to vote
ESA
2008
Springer
15 years 2 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
115
click to vote
STACS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...