200 search results - page 24 / 40 » Job Shop Scheduling Problems with Controllable Processing Ti... |
SASO
2008
IEEE
14 years 3 months ago
2008
IEEE
Many authors recognize the limitations of hierarchical Grid scheduling in scalable environments, and proposed peer-to-peer solutions to this problem. However, most peerto-peer gri...
SIGMETRICS
2010
ACM
14 years 23 days ago
2010
ACM
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
COR
2006
13 years 8 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
RTSS
1998
IEEE
14 years 1 months ago
1998
IEEE
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities....
SIGMETRICS
2005
ACM
14 years 2 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...