Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905): Difference between revisions

@@ Property / author @@
-Yong He
@@ Property / author: Yong He / rank @@
-Normal rank
@@ 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.2005.02.008
+Normal rank
@@ Property / OpenAlex ID @@
+W1979623539
@@ Property / OpenAlex ID: W1979623539 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line machine covering
@@ Property / cites work: On-line machine covering / rank @@
+Normal rank
@@ Property / cites work @@
+Q4400843
@@ Property / cites work: Q4400843 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line bin-stretching
@@ Property / cites work: On-line bin-stretching / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for preemptive on-line scheduling
+Normal rank
@@ Property / cites work @@
+The exact LPT-bound for maximizing the minimum completion time
+Normal rank
@@ Property / cites work @@
+Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
+Normal rank
@@ Property / cites work @@
+Bin stretching revisited
@@ Property / cites work: Bin stretching revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal preemptive semi-online scheduling to minimize makespan on two related machines
+Normal rank
@@ Property / cites work @@
+Randomized on-line scheduling on two uniform machines
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling of Uniform Processor Systems
+Normal rank
@@ Property / cites work @@
+The optimal on-line parallel machine scheduling
@@ Property / cites work: The optimal on-line parallel machine scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Ordinal on-line scheduling for maximizing the minimum machine completion time
+Normal rank
@@ Property / cites work @@
+Q3626419
@@ Property / cites work: Q3626419 / rank @@
+Normal rank
@@ Property / cites work @@
+Semi on-line scheduling on two identical machines
@@ Property / cites work: Semi on-line scheduling on two identical machines / rank @@
+Normal rank
@@ Property / cites work @@
+A Level Algorithm for Preemptive Scheduling
@@ Property / cites work: A Level Algorithm for Preemptive Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Preemptive machine covering on parallel machines
@@ Property / cites work: Preemptive machine covering on parallel machines / rank @@
+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 @@
+Ordinal algorithms for parallel machine scheduling
+Normal rank
@@ Property / cites work @@
+Semi-online scheduling with decreasing job sizes
@@ Property / cites work: Semi-online scheduling with decreasing job sizes / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for randomized on-line multiprocessor scheduling
+Normal rank
@@ Property / cites work @@
+Semi-on-line problems on two identical machines with combined partial information
+Normal rank
@@ Property / cites work @@
+Semi-on-line scheduling with ordinal data on two uniform machines
+Normal rank
@@ Property / cites work @@
+Preemptive on-line scheduling for two uniform processors
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for maximizing the minimum machine completion time
+Normal rank