Lower and upper bounds for scheduling energy-consuming tasks with storage resources and piecewise linear costs.
Sandra Ulrich NgueveuChristian ArtiguesNabil AbsiSafia Kedad-SidhoumPublished in: J. Heuristics (2022)
Keyphrases
- piecewise linear
- lower and upper bounds
- resource consumption
- lower bound
- computational grids
- upper bound
- resource allocation
- resource constraints
- dynamic programming
- chaotic map
- upper and lower bounds
- finite sets
- lagrangian relaxation
- regression algorithm
- scheduling problem
- grid environment
- scheduling algorithm
- feature extraction
- branch and bound algorithm
- np hard