An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212): Difference between revisions

@@ Property / cites work @@
+Algorithms for Scheduling Tasks on Unrelated Processors
+Normal rank
@@ Property / cites work @@
+Tighter Bounds for the Multifit Processor Scheduling Algorithm
+Normal rank
@@ Property / cites work @@
+Bounds for Multifit Scheduling on Uniform Processors
+Normal rank
@@ Property / cites work @@
+Bounds for Certain Multiprocessing Anomalies
@@ Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
+Normal rank
@@ Property / cites work @@
+Exact and Approximate Algorithms for Scheduling Nonidentical Processors
+Normal rank
@@ Property / cites work @@
+Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Analysis of a linear programming heuristic for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Q4536419
@@ Property / cites work: Q4536419 / rank @@
+Normal rank
@@ Property / cites work @@
+On the exact upper bound for the Multifit processor scheduling algorithm
+Normal rank