188 search results - page 26 / 38 » Regret Minimization and Job Scheduling |
163
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
185
click to vote
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
206
click to vote
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
160
click to vote
RTSS
2005
IEEE
15 years 11 months ago
2005
IEEE
Periodic update transaction model has been used to maintain freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus in the past ...
167
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...