Scheduling unit-time jobs on processors with different capabilities (Q1121780): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0305-0548(89)90029-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2043741523
@@ Property / OpenAlex ID: W2043741523 / rank @@
+Normal rank
@@ Property / cites work @@
+On a scheduling problem where a job can be executed only by a limited number of processors
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Q4133147
@@ Property / cites work: Q4133147 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing mean weighted execution time loss on identical and uniform processors
+Normal rank
@@ Property / cites work @@
+Algorithms for Scheduling Tasks on Unrelated Processors
+Normal rank
@@ Property / cites work @@
+Optimal Preemptive Scheduling of Two Unrelated Processors
+Normal rank
@@ Property / cites work @@
+On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
+Normal rank
@@ Property / cites work @@
+Q4058442
@@ Property / cites work: Q4058442 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Bipartite Network Flow
@@ Property / cites work: Fast Algorithms for Bipartite Network Flow / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(IVI^3)\) algorithm for finding maximum flows in networks
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Network Flow and Testing Graph Connectivity
@@ Property / cites work: Network Flow and Testing Graph Connectivity / rank @@
+Normal rank