Semi-online scheduling with bounded job sizes on two uniform machines (Q338376): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6647908
@@ Property / zbMATH DE Number: 6647908 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling
@@ Property / zbMATH Keywords: scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+uniform machines
@@ Property / zbMATH Keywords: uniform machines / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+semi-online
@@ Property / zbMATH Keywords: semi-online / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bounded job sizes
@@ Property / zbMATH Keywords: bounded job sizes / 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.2016.08.022
+Normal rank
@@ Property / OpenAlex ID @@
+W2512747565
@@ Property / OpenAlex ID: W2512747565 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for List Schedules on Uniform Processors
@@ Property / cites work: Bounds for List Schedules on Uniform Processors / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized on-line scheduling on two uniform machines
+Normal rank
@@ Property / cites work @@
+Bounds for LPT Schedules on Uniform Processors
@@ Property / cites work: Bounds for LPT Schedules on Uniform Processors / rank @@
+Normal rank
@@ Property / cites work @@
+A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
+Normal rank
@@ Property / cites work @@
+Optimal non-preemptive semi-online scheduling on two related machines
+Normal rank
@@ Property / cites work @@
+Semi-online scheduling with known maximum job size on two uniform machines
+Normal rank
@@ Property / cites work @@
+Bin stretching revisited
@@ Property / cites work: Bin stretching revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Two semi-online scheduling problems on two uniform machines
+Normal rank
@@ Property / cites work @@
+Semi-online scheduling with ``end of sequence'' information
+Normal rank
@@ Property / cites work @@
+Optimal preemptive semi-online scheduling on two uniform processors
+Normal rank
@@ Property / cites work @@
+Bounds on Schedules for Independent Tasks with Similar Execution Times
+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 @@
+The optimal on-line parallel machine scheduling
@@ Property / cites work: The optimal on-line parallel machine scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:338376