155 search results - page 14 / 31 » Online Scheduling of Equal-Length Jobs on Parallel Machines |
WAOA
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
JSSPP
2009
Springer
14 years 2 months ago
2009
Springer
It is important to identify scalability constraints in existing job scheduling software as they are applied to next generation parallel systems. In this paper, we analyze the scala...
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
Scheduling parallel jobs has been an active investigation area. The scheduler has to deal with heterogeneous workloads and try to obtain throughputs and response times such that en...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...