A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
2010
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. (C) 2009 Elsevier B.V. All rights reserved.
Details
Title
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
Author(s)
Kis, Tamas ; de Werra, Dominique ; Kubiak, Wieslaw
Published in
Operations Research Letters
Volume
38
Pages
129-132
Date
2010
Keywords
Other identifier(s)
View record in Web of Science
Laboratories
ROSE
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > ROSE - Chair of Operations Research SE
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2011-12-16