Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037): 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.1007/s00236-007-0058-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2012685288
@@ Property / OpenAlex ID: W2012685288 / 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 @@
+Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
+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 @@
+Preemptive Online Scheduling: Optimal Algorithms for All Speeds
+Normal rank
@@ Property / cites work @@
+Randomized on-line scheduling on two uniform machines
+Normal rank
@@ Property / cites work @@
+A lower bound for on-line scheduling on uniformly related machines
+Normal rank
@@ Property / cites work @@
+STACS 2004
@@ Property / cites work: STACS 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling of Uniform Processor Systems
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
+Normal rank
@@ Property / cites work @@
+Optimal semi-online preemptive algorithms for machine covering on two uniform machines
+Normal rank
@@ Property / cites work @@
+Ordinal on-line scheduling for maximizing the minimum machine completion time
+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 @@
+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 @@
+Scheduling with Deadlines and Loss Functions
@@ Property / cites work: Scheduling with Deadlines and Loss Functions / rank @@
+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 @@
+Semi-on-line scheduling with ordinal data on two uniform machines
+Normal rank
@@ Property / cites work @@
+Semi-on-line problems on two identical machines with combined partial information
+Normal rank
@@ Property / cites work @@
+Semi-online scheduling problems on two identical machines with inexact partial information
+Normal rank
@@ Property / cites work @@
+Preemptive on-line scheduling for two uniform processors
+Normal rank