Approximation schemes for scheduling and covering on unrelated machines (Q2503309): Difference between revisions

@@ Property / author @@
-Pavlos S. Efraimidis
@@ Property / author: Pavlos S. Efraimidis / rank @@
-Normal rank
@@ Property / author @@
-Q1125794
@@ Property / author: Q1125794 / rank @@
-Normal rank
@@ Property / author @@
+Pavlos S. Efraimidis
@@ Property / author: Pavlos S. Efraimidis / rank @@
+Normal rank
@@ Property / author @@
+Paul G. Spirakis
@@ Property / author: Paul G. Spirakis / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2006.05.025
+Normal rank
@@ Property / OpenAlex ID @@
+W1990454708
@@ Property / OpenAlex ID: W1990454708 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796176
@@ Property / cites work: Q4796176 / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
+Normal rank
@@ Property / cites work @@
+Q4400843
@@ Property / cites work: Q4400843 / rank @@
+Normal rank
@@ Property / cites work @@
+The exact LPT-bound for maximizing the minimum completion time
+Normal rank
@@ Property / cites work @@
+Approximation schemes for scheduling and covering on unrelated machines
+Normal rank
@@ Property / cites work @@
+Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Coordination Complexity of Parallel Price-Directive Decomposition
+Normal rank
@@ Property / cites work @@
+Probabilistic methods for algorithmic discrete mathematics
+Normal rank
@@ Property / cites work @@
+Optimal semi-online preemptive algorithms for machine covering on two uniform machines
+Normal rank
@@ Property / cites work @@
+Ordinal on-line scheduling for maximizing the minimum machine completion time
+Normal rank
@@ Property / cites work @@
+Exact and Approximate Algorithms for Scheduling Nonidentical Processors
+Normal rank
@@ Property / cites work @@
+Improved approximation schemes for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Q4501555
@@ Property / cites work: Q4501555 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Q4821818
@@ Property / cites work: Q4821818 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4788604
@@ Property / cites work: Q4788604 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic construction of deterministic algorithms: approximating packing integer programs
+Normal rank
@@ Property / cites work @@
+A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation algorithms for machine scheduling: Ten open problems
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+How asymmetry helps load balancing
@@ Property / cites work: How asymmetry helps load balancing / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for maximizing the minimum machine completion time
+Normal rank