Non-clairvoyant weighted flow time scheduling on different multi-processor models (Q2344210): Difference between revisions

@@ Property / Wikidata QID @@
+Q58062872
@@ Property / Wikidata QID: Q58062872 / rank @@
+Normal rank
@@ Property / cites work @@
+Tighter bounds on preemptive job shop scheduling with two machines
+Normal rank
@@ Property / cites work @@
+Q4471337
@@ Property / cites work: Q4471337 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921672
@@ Property / cites work: Q2921672 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-clairvoyant Speed Scaling for Weighted Flow Time
+Normal rank
@@ Property / cites work @@
+On-line scheduling of two-machine open shops where jobs arrive over time
+Normal rank
@@ Property / cites work @@
+The two-machine total completion time flow shop problem
+Normal rank
@@ Property / cites work @@
+Scheduling in the dark
@@ Property / cites work: Scheduling in the dark / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633880
@@ Property / cites work: Q4633880 / rank @@
+Normal rank
@@ Property / cites work @@
+Speed is as powerful as clairvoyance
@@ Property / cites work: Speed is as powerful as clairvoyance / rank @@
+Normal rank
@@ Property / cites work @@
+Nonclairvoyant scheduling
@@ Property / cites work: Nonclairvoyant scheduling / rank @@
+Normal rank