Semi-Online Preemptive Scheduling: One Algorithm for All Variants.
Tomás EbenlendrJirí SgallPublished in: Theory Comput. Syst. (2011)
Keyphrases
- detection algorithm
- experimental evaluation
- optimization algorithm
- search space
- particle swarm optimization
- times faster
- preprocessing
- computational cost
- dynamic programming
- cost function
- simulated annealing
- recognition algorithm
- improved algorithm
- optimal solution
- objective function
- online algorithms
- preemptive scheduling
- k means
- matching algorithm
- linear programming
- parallel machines
- convergence rate
- segmentation algorithm
- computationally efficient
- expectation maximization
- input data
- real time
- special case
- significant improvement
- lower bound
- similarity measure
- genetic algorithm