Author:
Bunde David P.,Goldwasser Michael H.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. Algorithmica 47(3), 253–268 (2007)
2. Baruah, S.K., Haritsa, J.R., Sharma, N.: On-line scheduling to maximize task completions. J. Combin. Math. and Combin. Computing 39, 65–78 (2001)
3. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York (1998)
4. Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tichý, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. J. Discrete Algorithms 4(2), 255–276 (2006)
5. Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Online scheduling of equal-length jobs: Randomization and restarts help. SIAM Journal on Computing 36(6), 1709–1728 (2007)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Commitment and Slack for Online Load Maximization;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06
2. Online Scheduling of Unit Length Jobs with Commitment and Penalties;Advanced Information Systems Engineering;2014