Improved competitive algorithms for online scheduling with partial job values (Q1884846): 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.tcs.2004.02.046
+Normal rank
@@ Property / OpenAlex ID @@
+W1553311347
@@ Property / OpenAlex ID: W1553311347 / rank @@
+Normal rank
@@ Property / cites work @@
+On the competitiveness of on-line real-time task scheduling
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4551383
@@ Property / cites work: Q4551383 / rank @@
+Normal rank
@@ Property / cites work @@
+Online scheduling with partial job values: does timesharing or randomization help?
+Normal rank
@@ Property / cites work @@
+Preemptive scheduling in overloaded systems.
@@ Property / cites work: Preemptive scheduling in overloaded systems. / 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 @@
+$\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
+Normal rank
@@ Property / cites work @@
+Q2768377
@@ Property / cites work: Q2768377 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526977
@@ Property / cites work: Q4526977 / rank @@
+Normal rank