Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Albers, S.: Better bounds for online scheduling. In: Proc. 29th Symp. Theory of Computing, pp. 130–139 (1997)
2. Chekuri, C., Motwani, R., Natarajan, B., Stein, C.: Approximation techniques for average completion time scheduling. In: Proc. 8th Symp. On Discrete Algorithms, pp. 609–618 (1997)
3. Chen, B., van Vliet, A., Woeginger, G.J.: New lower and upper bounds for on-line scheduling. Operations Research Letters 16, 221–230 (1994)
4. Chen, B., Vestjens, A.P.A.: Scheduling on identical machines: How good is LPT in an on-line setting? Operations Research Letters 21, 165–169 (1998)
5. Galambos, G., Woeginger, G.J.: An on-line scheduling heuristic with better worst case ratio than Graham’s list scheduling. SIAM Journal on Computing 22, 349–355 (1993)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献