Approximation algorithms for scheduling unrelated parallel machines (Abstract)

We consider the following problem. There are m parallel machines and n independent jobs. Each job is to be assigned to one of the machines. The processing of job j on machine i requires time P ij . The objective is to find a schedule that minimizes the makespan.