Approximating total flow time on parallel machines (Q2641865): Difference between revisions

@@ Property / author @@
-Stefano Leonardi
@@ Property / author: Stefano Leonardi / rank @@
-Normal rank
@@ Property / author @@
+Stefano Leonardi
@@ Property / author: Stefano Leonardi / 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.jcss.2006.10.018
+Normal rank
@@ Property / OpenAlex ID @@
+W1998382156
@@ Property / OpenAlex ID: W1998382156 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing total flow time and total completion time with immediate dispatching
+Normal rank
@@ Property / cites work @@
+Minimizing the Flow Time Without Migration
@@ Property / cites work: Minimizing the Flow Time Without Migration / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471337
@@ Property / cites work: Q4471337 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
+Normal rank
@@ Property / cites work @@
+Average stretch without migration
@@ Property / cites work: Average stretch without migration / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for minimizing weighted flow time
@@ Property / cites work: Algorithms for minimizing weighted flow time / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing mean flow time with release time constraint
+Normal rank
@@ Property / cites work @@
+Online algorithms. The state of the art
@@ Property / cites work: Online algorithms. The state of the art / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing flow time nonclairvoyantly
@@ Property / cites work: Minimizing flow time nonclairvoyantly / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228496
@@ Property / cites work: Q4228496 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
+Normal rank
@@ Property / cites work @@
+A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines
+Normal rank
@@ Property / cites work @@
+Q4526975
@@ Property / cites work: Q4526975 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3940839
@@ Property / cites work: Q3940839 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4194705
@@ Property / cites work: Q4194705 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonclairvoyant scheduling
@@ Property / cites work: Nonclairvoyant scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Online Scheduling to Minimize Average Stretch
@@ Property / cites work: Online Scheduling to Minimize Average Stretch / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation algorithms for machine scheduling: Ten open problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2641865