Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
From MaRDI portal
Publication:2117220
DOI10.1007/978-3-030-78230-6_14OpenAlexW3168834712MaRDI QIDQ2117220
Claire Hanen, Alix Munier Kordon, Theo Pedersen
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-78230-6_14
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- A preemptive bound for the resource constrained project scheduling problem
- Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows
- Methods to solve multi-skill project scheduling problem
- NP-complete scheduling problems
- A \(O(n\log ^2 n)\) checker and \(O(n^2\log n)\) filtering algorithm for the energetic reasoning
- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem
- The worst-case analysis of the Garey-Johnson algorithm
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
- Une méthode arborescente pour résoudre les problèmes cumulatifs
- A new approach to the maximum-flow problem
- Preemptive Scheduling with Release Times, Deadlines, and Due Times
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Two-Processor Scheduling with Start-Times and Deadlines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
