Publication
We study a multiprocessor extension of the preemptive open shop scheduling problem, where the set of processors is partitioned into processor groups. We show that the makespan minimization problem is polynomially solvable for two multiprocessor groups even if preemptions are restricted to integral times. (C) 2009 Elsevier B.V. All rights reserved.
Joshua Alexander Harrison Klein
Marco Mattavelli, Simone Casale Brunet, Aurélien François Gilbert Bloch