Optimal online algorithms for scheduling on two identical machines under a grade of service (Q2508148): Difference between revisions

@@ Property / cites work @@
+The Competitiveness of On-Line Assignments
@@ Property / cites work: The Competitiveness of On-Line Assignments / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal preemptive semi-online scheduling to minimize makespan on two related machines
+Normal rank
@@ Property / cites work @@
+Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling under a grade of service provision
+Normal rank
@@ Property / cites work @@
+Parallel machines scheduling with nonsimultaneous machine available time
+Normal rank
@@ Property / cites work @@
+A note on ''parallel machine scheduling with non-simultaneous machine available time''
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with nonsimultaneous machine available times
+Normal rank