Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. B. Awerbuch, S. Kutten, and D. Peleg. Competitive distributed job scheduling. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 571–581, 1992. 128
2. J. L. Bruno, E. G. Coffman Jr., and R. Sethi. Scheduling independent tasks to reduce mean finishing time. Communications of the Association for Computing Machinery, 17:382–387, 1974. 128
3. S. J. Chung and K. G. Murty. Polynomially bounded ellipsoid algorithms for convex quadratic programming. In O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, editors, Nonlinear Programming 4, pages 439–485. Academic Press, 1981. 134
4. X. Deng, H. Liu, J. Long, and B. Xiao. Deterministic load balancing in computer networks. In Proceedings of the 2nd Annual IEEE Symposium on Parallel and Distributed Processing, pages 50–57, 1990. 128
5. M. E. Dyer and L. A. Wolsey. Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics, 26:255–270, 1990. 129
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Convex Quadratic Programming in Scheduling;Gems of Combinatorial Optimization and Graph Algorithms;2015
2. Customer order scheduling to minimize total weighted completion time;Omega;2007-10
3. Designing PTASs for MIN-SUM scheduling problems;Discrete Applied Mathematics;2006-03
4. Designing PTASs for MIN-SUM Scheduling Problems;Fundamentals of Computation Theory;2001
5. Scheduling on a Constant Number of Machines;Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques;1999