| Article ID: | iaor20101719 |
| Volume: | 38 |
| Issue: | 2 |
| Start Page Number: | 129 |
| End Page Number: | 132 |
| Publication Date: | Mar 2010 |
| Journal: | Operations Research Letters |
| Authors: | Kubiak Wieslaw, Kis Tams, de Werra Dominique |
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.