An improved lower bound for rank four scheduling (Q1785250): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2014.06.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2016342875
@@ Property / OpenAlex ID: W2016342875 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Makespan Scheduling with Low Rank Processing Times
+Normal rank
@@ Property / cites work @@
+On the optimality of approximation schemes for the classical scheduling problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+An optimal rounding gives a better approximation for scheduling unrelated machines
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / rank @@
+Normal rank