APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS (Q3021973): Difference between revisions

@@ Property / author @@
+Denis Trystram
@@ Property / author: Denis Trystram / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The discrete time-cost tradeoff problem revisited
@@ Property / cites work: The discrete time-cost tradeoff problem revisited / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition theorem for partially ordered sets
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling Parallel Task Systems
@@ Property / cites work: Complexity of Scheduling Parallel Task Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling under Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0129054102001308
+Normal rank
@@ Property / OpenAlex ID @@
+W1975231449
@@ Property / OpenAlex ID: W1975231449 / rank @@
+Normal rank