Author:
Correa José R.,Wagner Michael R.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference28 articles.
1. Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 32–43 (1999)
2. Albers S. and Schröder B. (2002). An experimental study of online scheduling algorithms. J. Exp. Algorithmics 7: 3
3. Anderson E.J. and Potts C.N. (2004). On-line scheduling of a single machine to minimize total weighted completion time. Math. Oper. Res. 29: 686–697
4. Chakrabarti S., Phillips C., Schulz A.S., Shmoys D.B., Stein C. and Wein J. (1996). Improved scheduling algorithms for minsum criteria,” in Automata, Languages and Programming (ICALP), LNCS, vol. 1099. Springer, Heidelberg, pp 646–657
5. Chekuri C., Motwani R., Natarajan B. and Stein C. (2001). Approximation techniques for average completion time scheduling. SIAM J. Comput. 31: 146–166
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献