From Preemptive to Non-preemptive Scheduling Using Rejections (Q2817893): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2497949507
@@ Property / OpenAlex ID: W2497949507 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471337
@@ Property / cites work: Q4471337 / rank @@
+Normal rank
@@ Property / cites work @@
+The Geometry of Scheduling
@@ Property / cites work: The Geometry of Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Online weighted flow time and deadline scheduling
@@ Property / cites work: Online weighted flow time and deadline scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for average stretch scheduling
+Normal rank
@@ Property / cites work @@
+SPT is optimally competitive for uniprocessor flow
+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 @@
+Rejecting jobs to Minimize Load and Maximum Flow-time
+Normal rank
@@ Property / cites work @@
+Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model.
+Normal rank
@@ Property / cites work @@
+Optimal on-line flow time with resource augmentation
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]
+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 @@
+Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
+Normal rank
@@ Property / cites work @@
+Approximating total flow time on parallel machines
+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 @@
+Optimal time-critical scheduling via resource augmentation
+Normal rank
@@ Property / cites work @@
+Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
+Normal rank
@@ Property / cites work @@
+WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines
+Normal rank