An Improved Upper-Bound Algorithm for Non-preemptive Task Scheduling.
Stefan AndreiAlbert M. K. ChengVlad RadulescuPublished in: SYNASC (2015)
Keyphrases
- upper bound
- experimental evaluation
- computationally efficient
- worst case
- lower bound
- dynamic programming
- learning algorithm
- high accuracy
- segmentation algorithm
- computational cost
- np hard
- times faster
- detection algorithm
- particle swarm optimization
- optimization algorithm
- computational complexity
- improved algorithm
- lower and upper bounds
- convergence rate
- average case
- linear programming
- probabilistic model
- preprocessing
- objective function
- theoretical analysis
- cost function
- significant improvement
- clustering method
- tree structure
- matching algorithm
- optimal solution
- single machine
- similarity measure
- decision trees