Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298): Difference between revisions

@@ Property / cites work @@
+Q3949970
@@ Property / cites work: Q3949970 / rank @@
+Normal rank
@@ Property / cites work @@
+The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders
+Normal rank
@@ Property / cites work @@
+Optimal scheduling for two-processor systems
@@ Property / cites work: Optimal scheduling for two-processor systems / rank @@
+Normal rank
@@ Property / cites work @@
+Profile Scheduling of Opposing Forests and Level Orders
+Normal rank
@@ Property / cites work @@
+Scheduling Flat Graphs
@@ Property / cites work: Scheduling Flat Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling precedence graphs of bounded height
@@ Property / cites work: Scheduling precedence graphs of bounded height / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Opposing Forests
@@ Property / cites work: Scheduling Opposing Forests / rank @@
+Normal rank
@@ Property / cites work @@
+Q3885184
@@ Property / cites work: Q3885184 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal scheduling on parallel machines for a new order class
+Normal rank
@@ Property / cites work @@
+The Recognition of Series Parallel Digraphs
@@ Property / cites work: The Recognition of Series Parallel Digraphs / rank @@
+Normal rank