An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead.
Wenjie LiJinjiang YuanPublished in: Asia Pac. J. Oper. Res. (2015)
Keyphrases
- equal length
- single machine
- competitive ratio
- learning algorithm
- preemptive scheduling
- scheduling problem
- online algorithms
- computational complexity
- online learning
- objective function
- total weighted tardiness
- ant colony optimization
- metaheuristic
- average case
- simulated annealing
- dynamic programming
- optimal solution
- single machine scheduling problem
- worst case
- np hard