8 search results - page 2 / 2 » Preemptive Multi-Machine Scheduling of Equal-Length Jobs to ... |
STOC
1996
ACM
13 years 9 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
FOCS
2007
IEEE
13 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...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Broadcasting is known to be an efficient means of disseminating data in wireless communication environments (such as Satellite, mobile phone networks,...). It has been recently ob...