Optimal online algorithms on two hierarchical machines with tightly-grouped processing times.
An ZhangYiwei JiangLidan FanJueliang HuPublished in: J. Comb. Optim. (2015)
Keyphrases
- competitive ratio
- processing times
- online algorithms
- single machine
- identical parallel machines
- identical machines
- scheduling problem
- flowshop
- lower bound
- online learning
- average case
- worst case
- optimal strategy
- setup times
- release dates
- asymptotically optimal
- scheduling decisions
- dynamic programming
- high dimensional
- learning algorithm
- parallel machines
- convergence rate
- genetic algorithm