Optimal algorithms for online scheduling with bounded rearrangement at the end.
Xin ChenYan LanAttila BenkoGyörgy DósaXin HanPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- exhaustive search
- worst case
- online algorithms
- computational efficiency
- computational cost
- learning algorithm
- data structure
- optimization problems
- computationally efficient
- data sets
- parallel processors
- asymptotically optimal
- machine learning algorithms
- online learning
- lower bound
- theoretical analysis
- multi objective
- resource allocation
- significant improvement
- times faster
- evolutionary algorithm
- optimal solution
- real time
- efficient algorithms for computing