Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855): 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.1016/j.dam.2004.12.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2051819308
@@ Property / OpenAlex ID: W2051819308 / rank @@
+Normal rank
@@ Property / cites work @@
+Better Bounds for Online Scheduling
@@ Property / cites work: Better Bounds for Online Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+On randomized online scheduling
@@ Property / cites work: On randomized online scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+On-line machine covering
@@ Property / cites work: On-line machine covering / rank @@
+Normal rank
@@ Property / cites work @@
+On-line bin-stretching
@@ Property / cites work: On-line bin-stretching / rank @@
+Normal rank
@@ Property / cites work @@
+New algorithms for an ancient scheduling problem.
@@ Property / cites work: New algorithms for an ancient scheduling problem. / rank @@
+Normal rank
@@ Property / cites work @@
+Bin stretching revisited
@@ Property / cites work: Bin stretching revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q4708574
@@ Property / cites work: Q4708574 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3031924
@@ Property / cites work: Q3031924 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling revisited
@@ Property / cites work: On-line scheduling revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for Certain Multiprocessing Anomalies
@@ Property / cites work: Bounds for Certain Multiprocessing Anomalies / 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 @@
+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 Better Algorithm for an Ancient Scheduling Problem
+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 @@
+Online algorithms. The state of the art
@@ Property / cites work: Online algorithms. The state of the art / 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 @@
+Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
+Normal rank