Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming (Q5245846): Difference between revisions

@@ Property / cites work @@
+Better Bounds for Online Scheduling
@@ Property / cites work: Better Bounds for Online Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+On-line routing of virtual circuits with applications to load balancing and machine scheduling
+Normal rank
@@ Property / cites work @@
+Ancient and new algorithms for load balancing in the \(\ell_p\) norm
+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 @@
+On-Line Load Balancing for Related Machines
@@ Property / cites work: On-Line Load Balancing for Related Machines / rank @@
+Normal rank
@@ Property / cites work @@
+New lower and upper bounds for on-line scheduling
@@ Property / cites work: New lower and upper bounds for on-line scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling revisited
@@ Property / cites work: On-line scheduling revisited / 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 @@
+An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
+Normal rank
@@ Property / cites work @@
+Improved Bounds for the Online Scheduling Problem
@@ Property / cites work: Improved Bounds for the Online Scheduling Problem / rank @@
+Normal rank