A polynomial algorithm for some preemptive multiprocessor task scheduling problems (Q2432888): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2005.07.022
+Normal rank
@@ Property / OpenAlex ID @@
+W1968573124
@@ Property / OpenAlex ID: W1968573124 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q62048705
@@ Property / Wikidata QID: Q62048705 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Linear Ordering
@@ Property / cites work: Optimal Linear Ordering / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q4859840
@@ Property / cites work: Q4859840 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing total completion time in two-processor task systems with prespecified processor allocations
+Normal rank
@@ Property / cites work @@
+Scheduling multiprocessor tasks for mean flow time criterion
+Normal rank
@@ Property / cites work @@
+Complexity of scheduling multiprocessor tasks with prespecified processors allocations
+Normal rank
@@ Property / cites work @@
+Q4708601
@@ Property / cites work: Q4708601 / rank @@
+Normal rank