25 search results - page 2 / 5 » Minimizing Busy Time in Multiple Machine Real-time Schedulin... |
143
click to vote
RTAS
2008
IEEE
15 years 10 months ago
2008
IEEE
The convergence of computers and the physical world is the theme for next generation networking research. This trend calls for real-time network infrastructure, which requires a h...
146
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
121
Voted
EMSOFT
2007
Springer
15 years 9 months ago
2007
Springer
This paper proposes a scheduling strategy and an automatic scheduling flow that enable the simultaneous execution of multiple hard-real-time dataflow jobs. Each job has its own ...
145
Voted
CPAIOR
2007
Springer
15 years 9 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...
149
Voted
BIRTHDAY
2009
Springer
15 years 7 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...