Optimal Preemptive Semi-Online Algorithm for Scheduling Tightly-Grouped Jobs on Two Uniform Machines.
Yiwei JiangYong HePublished in: Asia Pac. J. Oper. Res. (2006)
Keyphrases
- competitive ratio
- identical parallel machines
- optimal scheduling
- dynamic programming
- scheduling problem
- optimal solution
- scheduling strategy
- scheduling algorithm
- detection algorithm
- online algorithms
- parallel machines
- scheduling policies
- worst case
- single machine
- np hard
- learning algorithm
- optimal parameters
- optimal strategy
- strongly np hard
- processing times
- globally optimal
- worst case performance ratio
- identical machines
- cost function
- k means
- objective function
- combinatorial optimization
- average case
- segmentation algorithm
- precedence constraints
- expectation maximization
- online learning
- minimize total
- simulated annealing
- search space
- lower bound
- computational complexity