32 search results - page 1 / 7 » On Minimizing the Maximum Flow Time in the Online Dial-a-Rid... |
WAOA
2005
Springer
13 years 10 months ago
2005
Springer
BIRTHDAY
2009
Springer
13 years 8 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...
FOCS
2007
IEEE
13 years 8 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...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
In this paper the online pull-based broadcast model is considered. In this model, there are n pages of data stored at a server and requests arrive for pages online. When the serve...