103 search results - page 1 / 21 » Online weighted flow time and deadline scheduling |
JDA
2006
13 years 5 months ago
2006
COR
2011
12 years 12 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
ESA
2010
Springer
13 years 5 months ago
2010
Springer
We study online job scheduling on a processor that can vary its speed dynamically to manage its power. We attempt to extend the recent success in analyzing total unweighted flow ti...
COCOON
2005
Springer
13 years 11 months ago
2005
Springer
We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneousl...
COCOON
2006
Springer
13 years 9 months ago
2006
Springer
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...