38 search results - page 3 / 8 » Preemptive Scheduling with Position Costs |
CONSTRAINTS
2011
13 years 2 months ago
2011
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
TC
2002
13 years 7 months ago
2002
The low cost and wide availability of networks of workstations have made them an attractive solution for high performance computing. However, while a network of workstations may be...
STOC
1996
ACM
13 years 12 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
LCTRTS
2010
Springer
13 years 9 months ago
2010
Springer
In preemptive real-time systems, scheduling analyses need—in addition to the worst-case execution time—the context-switch cost. In case of preemption, the preempted and the pr...