Article ID Journal Published Year Pages File Type
1142607 Operations Research Letters 2010 4 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
Authors
, , ,