155 search results - page 2 / 31 » Online Scheduling of Equal-Length Jobs on Parallel Machines |
MICS
2010
13 years 3 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
JDA
2008
13 years 5 months ago
2008
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case ...
WAOA
2004
Springer
13 years 10 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
COLOGNETWENTE
2008
13 years 6 months ago
2008
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...
ORL
2008
13 years 5 months ago
2008