Optimal preemptive semi-online scheduling on two uniform processors (Q834944): Difference between revisions

@@ Property / cites work @@
+Semi-on-line scheduling on two parallel processors with an upper bound on the items
+Normal rank
@@ Property / cites work @@
+Optimal preemptive semi-online scheduling to minimize makespan on two related machines
+Normal rank
@@ Property / cites work @@
+Q4708574
@@ Property / cites work: Q4708574 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized on-line scheduling on two uniform machines
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling of Uniform Processor Systems
+Normal rank
@@ Property / cites work @@
+Semi on-line scheduling on two identical machines
@@ Property / cites work: Semi on-line scheduling on two identical machines / rank @@
+Normal rank
@@ Property / cites work @@
+Semi on-line algorithms for the partition problem
@@ Property / cites work: Semi on-line algorithms for the partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Ordinal algorithms for parallel machine scheduling
+Normal rank
@@ Property / cites work @@
+Semi-online scheduling with decreasing job sizes
@@ Property / cites work: Semi-online scheduling with decreasing job sizes / rank @@
+Normal rank
@@ Property / cites work @@
+Preemptive on-line scheduling for two uniform processors
+Normal rank