Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms.
Jirí SgallGerhard J. WoegingerPublished in: WAOA (2014)
Keyphrases
- competitive ratio
- processing times
- online algorithms
- scheduling problem
- single machine
- flowshop
- scheduling decisions
- completion times
- online learning
- lower bound
- scheduling algorithm
- parallel machines
- average case
- worst case
- learning algorithm
- precedence constraints
- single machine scheduling problem
- optimal strategy
- np hard
- upper bound
- convergence rate
- semi supervised
- multi class