974 search results - page 44 / 195 » scheduling 2010 |
ESWA
2010
13 years 7 months ago
2010
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most prod...
MICS
2010
13 years 7 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
RTAS
2010
IEEE
13 years 6 months ago
2010
IEEE
Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different c...
PDP
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract—Among the numerous DAG scheduling heuristics suitable for heterogeneous systems, the Heterogeneous Earliest Finish Time (HEFT) heuristic is known to give good results in...
TACAS
2010
Springer
13 years 6 months ago
2010
Springer
The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks,...