Improved parameterized algorithms for scheduling with precedence constraints and time windows
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- scientific article; zbMATH DE number 6157240 (Why is no real title available?)
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Complexity of Scheduling under Precedence Constraints
- Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines
- NP-complete scheduling problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parameterized complexity of machine scheduling: 15 open problems
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
- Scheduling precedence graphs of bounded height
- Two-Processor Scheduling with Start-Times and Deadlines
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
Cited in
(1)
This page was built for publication: Improved parameterized algorithms for scheduling with precedence constraints and time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866529)
