Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines

In this paper, we discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The objective is to minimize the weighted makespan of jobs, i.e., the maximum weighted completion time of jobs. This scheduling problem is a generalization of minimiz...

Ausführliche Beschreibung