Scheduling with forbidden sets

Citations of this article
Mendeley users who have this article in their library.


We consider the case of minimizing the makespan when scheduling tasks with respect to a class of so-called forbidden sets, i.e. sets of tasks that are not allowed to be scheduled in parallel. Following the notion of Graham et al. [7], the treated problem will be abbreviated by P∞|FS|Cmax. This problem is script N sign℘ hard even for unit task length and forbidden sets that contains exactly two elements. Moreover, we show that the existence of a polynomial-time approximation algorithm with a worst-case ratio strictly less than 2 implies ℘ = script N sign℘. We point out that the corresponding re-optimization problem (after changing the instance slightly) is script N sign℘ hard as well, even if only one forbidden set is added or removed. Furthermore, the latter re-optimization problems have approximation thresholds of 3/2 and 4/3, respectively. To conclude our results, we show that the bound of 3/2 is tight for the case of re-optimizing an optimal schedule after adding a new forbidden set.




Schäffter, M. W. (1997). Scheduling with forbidden sets. Discrete Applied Mathematics, 72(1–2), 155–166.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free