An improved approximation algorithm for scheduling under arborescence precedence constraints
From MaRDI portal
Publication:5089259
Cites work
- scientific article; zbMATH DE number 1187165 (Why is no real title available?)
- scientific article; zbMATH DE number 2102785 (Why is no real title available?)
- A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Complexity of Scheduling under Precedence Constraints
- Hardness of precedence constrained scheduling on identical machines
- Improved Approximation Algorithms for Shop Scheduling Problems
- Lagrangian duality in online scheduling with resource augmentation and speed scaling
- Lift and project algorithms for precedence constrained scheduling to minimize completion time
- Makespan minimization in job shops: a polynomial time approximation scheme
- Non-approximability results for scheduling problems with minsum criteria
- Optimal Long Code Test with One Free Bit
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Quasi-PTAS for scheduling with precedences using LP hierarchies
- Resource augmentation for weighted flow-time explained by dual fitting
- Scheduling on unrelated machines under tree-like precedence constraints
- Towards tight lower bounds for scheduling problems
Cited in
(1)
This page was built for publication: An improved approximation algorithm for scheduling under arborescence precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089259)
