1095 search results - page 1 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
77
Voted
IPCO
2010
14 years 12 months ago
2010
APPROX
2006
Springer
15 years 2 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
ICALP
2001
Springer
15 years 2 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...
ALGORITHMICA
2002
14 years 10 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
113
click to vote
ICPP
2002
IEEE
15 years 3 months ago
2002
IEEE
In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provi...