Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming.
Lin ChenDeshi YeGuochuan ZhangPublished in: Asia Pac. J. Oper. Res. (2015)
Keyphrases
- dynamic programming
- optimal solution
- learning algorithm
- computational complexity
- linear programming
- np hard
- locally optimal
- exhaustive search
- globally optimal
- worst case
- scheduling problem
- computational cost
- optimal scheduling
- particle swarm optimization
- segmentation algorithm
- preprocessing
- convergence rate
- piecewise linear
- infinite horizon
- optimal strategy
- search algorithm for solving
- knapsack problem
- single machine
- closed form
- matching algorithm
- detection algorithm
- simulated annealing
- multi objective
- decision trees