) algorithm for time-bound adjustments for the cumulative scheduling problem.
Jacques CarlierEric PinsonAbderrahim SahliAntoine JougletPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- scheduling problem
- experimental evaluation
- cost function
- np hard
- worst case
- learning algorithm
- objective function
- improved algorithm
- k means
- computational complexity
- computational cost
- theoretical analysis
- high accuracy
- lower bound
- detection algorithm
- optimization algorithm
- segmentation algorithm
- computationally efficient
- optimal solution
- dynamic programming
- preprocessing
- simulated annealing
- times faster
- list scheduling
- polynomial time approximation
- approximation algorithms
- convergence rate
- evolutionary algorithm
- image segmentation