Author:
Zhang Qiang,Wu Weiwei,Li Minming
Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenkom, Approximation schemes for minimizing average weighted completion time with release dates, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pp. 32–43.
2. Scheduling independent tasks to reduce mean finishing time;Bruno;Communications of the ACM,1974
3. Z. Chen, N. Hall, Supply chain scheduling: assembly systems, Tech. rep., Department of Systems Engineering, University of Pennsylvania, 2001.
4. Theory of Scheduling;Conway,2003
5. S. Dobzinski, M. Schapira, An improved approximation algorithm for combinatorial auctions with submodular bidders, in: Proceedings of the 17th Annual ACM–SIAM Symposium on Discrete Algorithm, 2006, pp. 1064–1073.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献