Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms.
Jirí SgallGerhard J. WoegingerPublished in: Oper. Res. Lett. (2023)
Keyphrases
- competitive ratio
- processing times
- scheduling problem
- online algorithms
- single machine
- flowshop
- scheduling decisions
- completion times
- online learning
- lower bound
- precedence constraints
- parallel machines
- learning algorithm
- single machine scheduling problem
- average case
- worst case
- np hard
- scheduling algorithm
- convergence rate
- bayesian networks
- decision trees
- data sets