Approximation schemes for machine scheduling with resource (in-)dependent processing times

Abstract

We consider two related scheduling problems: resource constrained scheduling on identical parallel machines and a generalization with resource dependent processing times. In both problems, jobs require a certain amount of an additional resource and have to be scheduled on machines minimizing the makespan, while at every point in time a given resource capacity is not exceeded. In the first variant of the problem the processing times and resource amounts are fixed, while in the second the former depends on the latter. We present asymptotic fully polynomial approximation schemes (AFPTAS) for the problems: For any ∊ > 0 a schedule of length at most (1 + ∊) times the optimum plus an additive term of ℴ(1/∊2) is provided, and the running time is polynomially bounded in 1/∊ and the input length. Up to now only approximation algorithms with constant approximation ratios were known.