The paper shows that a variant of greedy algorithm is asymptotically optimal for various scheduling problems.
