Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299): Difference between revisions

@@ Property / cites work @@
+Scheduling preemptive multiprocessor tasks on dedicated processors
+Normal rank
@@ Property / cites work @@
+Scheduling subject to resource constraints: Classification and complexity
+Normal rank
@@ Property / cites work @@
+Two Results Concerning Multicoloring
@@ Property / cites work: Two Results Concerning Multicoloring / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling File Transfers
@@ Property / cites work: Scheduling File Transfers / rank @@
+Normal rank
@@ Property / cites work @@
+Open Shop Scheduling to Minimize Finish Time
@@ Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of scheduling multiprocessor tasks with prespecified processors allocations
+Normal rank
@@ Property / cites work @@
+The complexity of scheduling independent two-processor tasks on dedicated processors
+Normal rank
@@ Property / cites work @@
+Interval edge coloring of a graph with forbidden colors
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for edge coloring of binomial trees
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+NP completeness of finding the chromatic index of regular graphs
+Normal rank