| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142861 | Operations Research Letters | 2006 | 8 Pages |
Abstract
We show that the greedy highest density first (HDF) algorithm is (1+ε)-speed O(1)-competitive for the problem of minimizing the âp norms of weighted flow time on m identical machines. Similar results for minimizing unweighted flow provide insight into the power of migration.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Carl Bussema, Eric Torng,