Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time.
Xing ChaiLingfa LuWenhua LiLiqi ZhangPublished in: Asia Pac. J. Oper. Res. (2018)
Keyphrases
- online algorithms
- single machine scheduling
- single machine scheduling problem
- single machine
- processing times
- minimize total
- online learning
- completion times
- worst case
- scheduling problem
- lower bound
- flowshop
- learning algorithm
- average case
- asymptotically optimal
- decision boundary
- total cost
- branch and bound algorithm
- dynamic programming
- parallel machines
- linear space
- response time
- support vector machine
- e learning