 |
Algorithms and complexity results for resource leveling problems
1 : EDF R&D
EDF Recherche et Développement
2 : Sorbonne Université, CNRS, LIP6 UMR 7606
Sorbonne Universités, UPMC, CNRS
3 : Institut Universitaire de France
Institut universitaire de France, Institut universitaire de France
Resource leveling problems with various classical scheduling constraints and resource overload minimization are studied. Polynomial-time resolution algorithms as well as complexity results are given which highlight strong links between resource leveling and machine scheduling.
