Three, four, five, six, or the complexity of scheduling with communication delays

Three, four, five, six, or the complexity of scheduling with communication delays

0.00 Avg rating0 Votes
Article ID: iaor19961187
Country: Netherlands
Volume: 16
Issue: 3
Start Page Number: 129
End Page Number: 137
Publication Date: Oct 1994
Journal: Operations Research Letters
Authors: , ,
Abstract:

A set of unit-time tasks has to be processed on identical parallel processors subject to precedence constraints and unit-time communication delays; does there exist a schedule of length at most d? The problem has two variants, depending on whether the number of processors is restrictively small or not. For the first variant the question can be answered in polynomial time for d=3 and is NP-complete for d=4. The second variant is solvable in polynomial time for d=5 and NP-complete for d=6. As a consequence, neither of the corresponding optimization problems has a polynomial approximation scheme, unless P=NP.

Reviews

Required fields are marked *. Your email address will not be published.