1095 search results - page 10 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
106
click to vote
CONSTRAINTS
2011
14 years 4 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...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
—We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unqua...
CCGRID
2010
IEEE
14 years 10 months ago
2010
IEEE
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...
79
Voted
WSC
2007
15 years 21 hour ago
2007
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
RTCSA
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper presents an implementation of feedback control strategy on distributed static scheduling. The static schedule is created taking into account the average execution times...