Loading...
research article
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
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.
Type
research article
Web of Science ID
WOS:000275782500012
Authors
Publication date
2010
Published in
Volume
38
Start page
129
End page
132
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
December 16, 2011
Use this identifier to reference this record