Preemptive scheduling on uniform machines to minimize mean flow time (Q1017456): 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.cor.2008.12.010
+Normal rank
@@ Property / OpenAlex ID @@
+W1973847436
@@ Property / OpenAlex ID: W1973847436 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57633894
@@ Property / Wikidata QID: Q57633894 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of mean flow time scheduling problems with release times
+Normal rank
@@ Property / cites work @@
+Q3217922
@@ Property / cites work: Q3217922 / rank @@
+Normal rank
@@ Property / cites work @@
+On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
+Normal rank
@@ Property / cites work @@
+Complexity of preemptive minsum scheduling on unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Q3339651
@@ Property / cites work: Q3339651 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank