A $2.28$-competitive algorithm for online scheduling on identical machines
2014
Online scheduling on identical machines is investigated in the
setting where jobs arrive over time. The goal is to minimize the total completion time. A waiting strategy based online algorithm is designed and is proved to be $2.28$-competitive. The result improves the current best online algorithm from the worse-case prospective.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
17
References
5
Citations
NaN
KQI