Approximation algorithms for scheduling on multiple machines

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 254-263

  Kumar, V S Anil ^a   Marathe, Madhav V ^a   Parthasarathy, Srinivasan ^b   Srinivasan, Aravind ^b  

^a State University   (United States)

^b University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; CONVEX PROGRAMMING; PARALLEL MACHINES; ROUNDING ALGORITHMS;

APPROXIMATION THEORY; FUNCTIONS; LINEAR PROGRAMMING; OPTIMIZATION; PARALLEL ALGORITHMS; SCHEDULING;

AUTOMATA THEORY;

EID: 33748606901     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.21     Document Type: Conference Paper

References (20)

1. N. Alon, Y. Azar, G. J. Woeginger, and T. Yadid. Approximation schemes for scheduling. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 493-500, 1997.
2. A. Archer. Mechanisms for Discrete Optimization with Rational Agents. PhD thesis, Cornell University, Jan 2004.
3. J. Aslam, A. Rasala, C. Stein, and N. Young. Improved bicriteria existence theorems for scheduling. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 846-847, 1999.
4. p norm. In IEEE Symposium on Foundations of Computer Science, pages 383-391, 1995.
5. Y. Azar and A. Epstein. Convex programming for scheduling unrelated parallel machines. In Proc. of the ACM Symposium on Theory of Computing, pages 331-337, 2005.
6. Y. Azar, L. Epstein, Y. Richter, and G. J. Woeginger. All-norm approximation algorithms. J. Algorithms, 52(2): 120-133, 2004.
7. Y. Azar and S. Taub. All-norm approximation for scheduling on identical machines. In SWAT, pages 298-310, 2004.
8. A. K. Chandra and C. K. Wong. Worst-case analysis of a placement algorithm related to storage allocation. SIAM J. on Computing, 4(3):249-263, 1975.
9. R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan. Dependent rounding in bipartite graphs. In Proc. IEEE Symposium on Foundations of Computer Science (FOCS), pages 323-332, 2002.
10. A. Goel and A. Meyerson. Simultaneous optimization via approximate majorization for concave profits or convex costs. Tech. Report CMU-CS-02-203, December 2002, Carnegie-Mellon University.
11. A. Grigoriev, M. Sviridenko, and M. Uetz. Unrelated parallel machine scheduling with resource dependent processing times. In Integer Programming and Combinatorial Optimization (IP CO), pages 182-195, 2005.
12. R. M. Karp, F. T. Leighton, R. L. Rivest, C. D. Thompson, U. V. Vazirani, and V. V. Vazirani. Global wire routing in two-dimensional arrays. Algorithmica, pages 113-129, 1987.
13. J. Kleinberg, E. Tardos, and Y. Rabani. Fairness in routing and load balancing. J. Comput. Syst. Sci., 63(1):2-20, 2001.
14. E. L. Lawler, J. K. Lenstra, A. H. G. R. Kan, and D. B. Shmoys. Sequencing and scheduling: algorithms and complexity. Elsevier, 1993.
15. J. K. Lenstra, D. B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, pages 259-271, 1990.
16. P. Raghavan and C. D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, pages 365-374, 1987.
17. P. Schuurman and G. J. Woeginger. Polynomial time approximation algorithms for machine scheduling: Ten open problems. J. Scheduling, pages 203-213, 1999.
18. D. B. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, pages 461-474, 1993.
19. M. Skutella. Convex quadratic and semidefinite relaxations in scheduling. Journal of the ACM, 46(2): 206-242, 2001.
20. C. Stein and J. Wein. On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Operations Research Letters, 21, 1997.