Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines.
Yong HeYiwei JiangPublished in: Acta Informatica (2004)
Keyphrases
- scheduling problem
- computational complexity
- orders of magnitude
- flowshop
- computationally efficient
- worst case
- learning algorithm
- parallel machines
- optimization problems
- computational cost
- greedy heuristics
- online learning
- theoretical analysis
- evolutionary algorithm
- tabu search
- benchmark problems
- lower bound
- real time
- online algorithms
- setup times