80 search results - page 5 / 16 » A tight lower bound for job scheduling with cancellation |
SIGMETRICS
2005
ACM
14 years 28 days 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 ...
ICALP
2004
Springer
14 years 23 days ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
ALGORITHMICA
2004
13 years 7 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
CPAIOR
2010
Springer
14 years 5 days ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
CLUSTER
2005
IEEE
14 years 1 months ago
2005
IEEE
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...