Preemptive online algorithms for scheduling with machine cost.
Yiwei JiangYong HePublished in: Acta Informatica (2005)
Keyphrases
- online algorithms
- competitive ratio
- scheduling problem
- scheduling algorithm
- scheduling decisions
- processing times
- lower bound
- flowshop
- single machine
- online learning
- parallel machines
- worst case
- learning algorithm
- average case
- completion times
- material handling
- asymptotically optimal
- response time
- decision boundary
- total cost
- upper bound
- support vector machine