Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors (Q2883650): Difference between revisions

@@ Property / author @@
-Claire Hanen
@@ Property / author: Claire Hanen / rank @@
-Normal rank
@@ Property / author @@
+Claire Hanen
@@ Property / author: Claire Hanen / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2010.05.100
+Normal rank
@@ Property / OpenAlex ID @@
+W1983452345
@@ Property / OpenAlex ID: W1983452345 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Insight into the Coffman–Graham Algorithm
@@ Property / cites work: A New Insight into the Coffman–Graham Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q2734595
@@ Property / cites work: Q2734595 / rank @@
+Normal rank
@@ Property / cites work @@
+Performance of Garey-Johnson algorithm for pipelined typed tasks systems
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling under Precedence Constraints
+Normal rank
@@ Property / cites work @@
+NP-complete scheduling problems
@@ Property / cites work: NP-complete scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+An iterative algorithm for scheduling UET tasks with due dates and release times.
+Normal rank
@@ Property / cites work @@
+An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2883650