Happach, Felix - In: Journal of Scheduling 24 (2021) 3, pp. 319-328
job. Usually, precedence constraints are given by a partial order on the set of jobs, and each job requires all its … result is in contrast to classical precedence constraints where the preemptive variant is already NP-hard. Our algorithm … generalizes previous results for unit processing time jobs subject to OR-precedence constraints, but without release dates. The …