On minimizing average weighted completion time of multiprocessor tasks with release dates

Abstract

We consider the problem of scheduling n independent multiprocessor tasks with release dates on a fixed number of processors, where the objective is to compute a non-preemptive schedule minimizing the average weighted completion time. For each task, in addition to its processing time and release date, there is given a prespecified, dedicated subset of processors which are required to process the task simultaneously. We propose here a polynomial-time approximation scheme for the problem, making substantial improvement on previous results and following the recent developments [1,2,15] on approximation schemes for scheduling problems with the average weighted completion time objective. © 2011 Springer-Verlag Berlin Heidelberg.