Preemptive semi-online algorithms for parallel machine scheduling with known total size (Q2508575): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10114-005-0686-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2031803346
@@ Property / OpenAlex ID: W2031803346 / 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 @@
+Q4710111
@@ Property / cites work: Q4710111 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472662
@@ Property / cites work: Q4472662 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
+Normal rank
@@ Property / cites work @@
+Semi-on-line scheduling problems for maximizing the minimum machine completion time
+Normal rank
@@ Property / cites work @@
+Q4709623
@@ Property / cites work: Q4709623 / 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 @@
+Optimal semi-online preemptive algorithms for machine covering on two uniform machines
+Normal rank
@@ Property / cites work @@
+Scheduling with Deadlines and Loss Functions
@@ Property / cites work: Scheduling with Deadlines and Loss Functions / rank @@
+Normal rank