Semi-online scheduling with known maximum job size on two uniform machines (Q613661): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-009-9214-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1970469043
@@ Property / OpenAlex ID: W1970469043 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear compound algorithm for uniform machine scheduling
+Normal rank
@@ Property / cites work @@
+Bounds for List Schedules on Uniform Processors
@@ Property / cites work: Bounds for List Schedules on Uniform Processors / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal non-preemptive semi-online scheduling on two related machines
+Normal rank
@@ Property / cites work @@
+Semi-online scheduling with ``end of sequence'' information
+Normal rank
@@ Property / cites work @@
+Randomized on-line scheduling on two uniform machines
+Normal rank
@@ Property / cites work @@
+Bounds for LPT Schedules on Uniform Processors
@@ Property / cites work: Bounds for LPT Schedules on Uniform Processors / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and Approximate Algorithms for Scheduling Nonidentical Processors
+Normal rank
@@ Property / cites work @@
+Q5427338
@@ Property / cites work: Q5427338 / rank @@
+Normal rank
@@ Property / cites work @@
+A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
+Normal rank
@@ Property / cites work @@
+Semi-on-line scheduling with ordinal data on two uniform machines
+Normal rank