The benefit of preemption for single machine scheduling so as to minimize total weighted completion time (Q1709959): Difference between revisions

@@ 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.orl.2016.09.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2529680039
@@ Property / OpenAlex ID: W2529680039 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Techniques for Average Completion Time Scheduling
+Normal rank
@@ Property / cites work @@
+The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
+Normal rank
@@ Property / cites work @@
+Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines
+Normal rank
@@ Property / cites work @@
+Single parameter analysis of power of preemption on two and three uniform machines
+Normal rank
@@ Property / cites work @@
+A tight lower bound for the best-\(\alpha\) algorithm
+Normal rank
@@ Property / cites work @@
+A comment on scheduling on uniform machines under chain-type precedence constraints
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1709959