188 search results - page 14 / 38 » Regret Minimization and Job Scheduling |
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
DAGSTUHL
2006
13 years 9 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
EUROPAR
2010
Springer
13 years 7 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
JCP
2008
13 years 7 months ago
2008
Abstract--Scheduling algorithm for batch-mode dataintensive jobs is a key issue in data-intensive Grid applications. It focuses on how to minimize the overhead of transferring the ...