Semi-on-line problems on two identical machines with combined partial information (Q1870021): Difference between revisions

@@ Property / cites work @@
+Q4247460
@@ Property / cites work: Q4247460 / 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 @@
+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 @@
+Semi-on-line scheduling with ordinal data on two uniform machines
+Normal rank
@@ Property / cites work @@
+Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
+Normal rank
@@ Property / cites work @@
+A note on on-line scheduling with partial information
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0167-6377(02)00164-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2053558677
@@ Property / OpenAlex ID: W2053558677 / rank @@
+Normal rank