Algorithms better than LPT for semi-online scheduling with decreasing processing times.
T. C. E. ChengHans KellererVladimir KotovPublished in: Oper. Res. Lett. (2012)
Keyphrases
- processing times
- scheduling problem
- single machine
- worst case
- scheduling jobs
- release dates
- learning algorithm
- online algorithms
- identical machines
- number of tardy jobs
- computational complexity
- identical parallel machines
- precedence relations
- online learning
- scheduling algorithm
- release times
- optimization problems
- np hard
- reinforcement learning