173 search results - page 13 / 35 » Special Cases of Online Parallel Job Scheduling |
104
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
91
Voted
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together w...
93
Voted
TPDS
2008
15 years 10 days ago
2008
Energy usage has been an important concern in recent research on online job scheduling, where processors are allowed to vary the speed dynamically so as to save energy whenever pos...
103
Voted
JSSPP
2007
Springer
15 years 6 months ago
2007
Springer
Heterogeneous clusters and grid infrastructures are becoming increasingly popular. In these computing infrastructures, machines have different resources, including memory sizes, d...
109
Voted
ICALP
2004
Springer
15 years 5 months 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...