Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors

The problem of scheduling a set of n unit execution time (UET) tasks subject to precedence constraints on m identical parallel processors is known to be N P -hard in the strong sense. However, polynomial time algorithms exist for some classes of precedence graphs. In this paper, we consider a class...

Full description

Bibliographic Details

Published in:	Discrete optimization Vol. 6; no. 1; pp. 79 - 91
Main Authors:	Kubiak, Wieslaw, Rebaine, Djamal, Potts, Chris
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.02.2009
Subjects:	Complexity Divide-and-conquer graph HLF Identical parallel processors Makespan Divide-and-conquer graph Makespan HLF Complexity Identical parallel processors
ISSN:	1572-5286, 1873-636X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!