Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317): Difference between revisions

@@ Property / cites work @@
+Online scheduling with a buffer on related machines
+Normal rank
@@ Property / cites work @@
+Preemptive Online Scheduling with Reordering
@@ Property / cites work: Preemptive Online Scheduling with Reordering / rank @@
+Normal rank
@@ Property / cites work @@
+Online scheduling with rearrangement on two related machines
+Normal rank
@@ Property / cites work @@
+The Power of Reordering for Online Minimum Makespan Scheduling
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Semi on-line algorithms for the partition problem
@@ Property / cites work: Semi on-line algorithms for the partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Online scheduling on two uniform machines to minimize the makespan
+Normal rank
@@ Property / cites work @@
+Online Scheduling with Bounded Migration
@@ Property / cites work: Online Scheduling with Bounded Migration / rank @@
+Normal rank
@@ Property / cites work @@
+Online scheduling with reassignment
@@ Property / cites work: Online scheduling with reassignment / rank @@
+Normal rank
@@ Property / cites work @@
+A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
+Normal rank