A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan.
Jinjiang YuanRuyan FuC. T. NgT. C. Edwin ChengPublished in: J. Sched. (2011)
Keyphrases
- times faster
- high accuracy
- dynamic programming
- improved algorithm
- experimental evaluation
- theoretical analysis
- parallel implementation
- optimal solution
- expectation maximization
- k means
- np hard
- worst case
- optimization algorithm
- particle swarm optimization
- simulated annealing
- search space
- hardware implementation
- learning algorithm
- online algorithms
- classification algorithm
- maximum likelihood
- linear programming
- data structure
- objective function
- similarity measure