Semi-on-line scheduling problems for maximizing the minimum machine completion time (Q5931905): Difference between revisions

@@ Property / cites work @@
+Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
+Normal rank
@@ Property / cites work @@
+Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
+Normal rank
@@ Property / cites work @@
+The exact LPT-bound for maximizing the minimum completion time
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for maximizing the minimum machine completion time
+Normal rank
@@ Property / cites work @@
+On-line machine covering
@@ Property / cites work: On-line machine covering / 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 @@
+Q3031924
@@ Property / cites work: Q3031924 / rank @@
+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 @@
+Ordinal algorithms for parallel machine scheduling
+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 @@
+A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
+Normal rank