A lower bound for randomized on-line multiprocessor scheduling (Q287130): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+New algorithms for an ancient scheduling problem.
@@ Property / cites work: New algorithms for an ancient scheduling problem. / rank @@
+Normal rank
@@ Property / cites work @@
+A better lower bound for on-line scheduling
@@ Property / cites work: A better lower bound for on-line scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for randomized on-line scheduling algorithms
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for preemptive on-line scheduling
+Normal rank
@@ Property / cites work @@
+Q3031924
@@ Property / cites work: Q3031924 / rank @@
+Normal rank
@@ Property / cites work @@
+An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
+Normal rank
@@ Property / cites work @@
+Bounds for Certain Multiprocessing Anomalies
@@ Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+Q4335203
@@ Property / cites work: Q4335203 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(97)00093-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1999476761
@@ Property / OpenAlex ID: W1999476761 / rank @@
+Normal rank