Megow, Nicole; Schulz, Andreas S. - 2003
We consider the scheduling problem of minimizing the average weighted completion time on identical parallel machines …-line algorithms, which are (4+epsilon)-competitive in either case. Our preemptive algorithm is 2-competitive, which actually meets the … competitive ratio of the currently best randomized on-line algorithm for this scenario. Our nonpreemptive algorithm has a …