Loading…
Preemptive scheduling with rejection
Hoogeveen, Han; Skutella, Martin; Woeginger, Gerhard J.
Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the jobs and thereby incur job-dependent penalties for each rejected job, and he must construct a schedule for the remaining jobs so as to optimize the preemptive makespan on the m machines plus the sum of the penalties of the jobs rejected.
