Algorithms to compute the energetic lower bounds of the cumulative scheduling problem.
Jacques CarlierAntoine JougletAbderrahim SahliPublished in: Ann. Oper. Res. (2024)
Keyphrases
- lower bound
- scheduling problem
- np hard
- orders of magnitude
- upper and lower bounds
- upper bound
- worst case
- computational complexity
- error bounds
- computational cost
- running times
- data mining
- online algorithms
- lower and upper bounds
- times faster
- special case
- significant improvement
- data structure
- objective function
- learning algorithm