57 search results - page 4 / 12 » Stochastic Online Scheduling on Parallel Machines |
DAGSTUHL
2006
13 years 11 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 ...
SWAT
2004
Springer
14 years 3 months ago
2004
Springer
We consider online scheduling of splittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independentl...
JCO
2010
13 years 8 months ago
2010
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
IOR
2010
13 years 8 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
SIAMDM
2002
13 years 9 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...