A unified approach to scheduling on unrelated parallel machines

Journal of the ACM

Volumn 56, Issue 5, 2009, Pages

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

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

Approximation algorithms; Randomized rounding; Scheduling under multiple criteria

Indexed keywords

BICRITERIA ALGORITHM; COMPLETION TIME; CONVEX PROGRAMMING; LINEAR-ALGEBRAIC; MAKESPAN; MULTI-CRITERIA; OBJECTIVE FUNCTIONS; PROBABILISTIC APPROACHES; RANDOMIZED ROUNDING; RESOURCE-DEPENDENT PROCESSING TIME; ROUNDING ALGORITHM; UNIFIED APPROACH; UNRELATED PARALLEL MACHINES; WEIGHTED COMPLETION;

APPROXIMATION ALGORITHMS; LINEARIZATION; PARALLEL ALGORITHMS; PARALLEL PROGRAMMING; PROGRAM INTERPRETERS;

SCHEDULING ALGORITHMS;

EID: 70349312844     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1552285.1552289     Document Type: Article

References (24)

1. Alon, N., Azar, Y., Woeginger, G. J., and Yadid, T. 1997. Approximation schemes for scheduling. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 493-500.
2. Aslam, J., Rasala, A., Stein, C., and Young, N. 1999. Improved bicriteria existence theorems for scheduling. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 846-847.
3. p norm. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, 383-391.
4. Azar, Y., and Epstein, A. 2005. Convex programming for scheduling unrelated parallel machines. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York, 331-337.
5. Azar, Y., Epstein, L., Richter, Y., and Woeginger, G. J. 2004. All-norm approximation algorithms. J. Algor. 52, 2, 120-133.
6. Azar, Y., and Taub, S. 2004. All-norm approximation for scheduling on identical machines. In Proceedings of the Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 298-310.
7. Chandra, A. K., and Wong, C. K. 1975. Worst-case analysis of a placement algorithm related to storage address. SIAM J. Comput. 4, 3, 249-263.
8. Gandhi, R., Khuller, S., Parthasarathy, S., and Srinivasan, A. 2006. Dependent rounding and its applications to approximation algorithms. J. ACM 53, 324-360.
9. Goel, A., and Meyerson, A. 2002. Simultaneous optimization via approximate majorization for concave profits or convex costs. Tech. Rep. CMU-CS-02-203, Carnegie-Mellon University, Pittsburgh.
10. Goemans, M. X., and Williamson, D. P. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115-1145.
11. Grigoriev, A., Sviridenko, M., and Uetz, M. 2005. Unrelated parallel machine scheduling with resource dependent processing times. In Proceedings of the Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 182-195.
12. Grigoriev, A., Sviridenko, M., and Uetz, M. 2007. Machine scheduling with resource dependent processing times. Math. Prog. 110, 209-228.
13. Karp, R. M., Leighton, F. T., Rivest, R. L., Thompson, C. D., Vazirani, U. V., and Vazirani, V. V. 1987. Global wire routing in two-dimensional arrays. Algorithmica 2, 113-129.
14. Kleinberg, J., Tardos, E., and Rabani, Y. 2001. Fairness in routing and load balancing. J. Comput. Syst. Sci. 63, 1, 2-20.
15. Kumar, V. S. A., Marathe, M. V., Parthasarathy, S., and Srinivasan, A. 2005. Approximation algorithms for scheduling on multiple machines. In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, 254-263.
16. Lavi, R., and Swamy, C. 2007. Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity. In Proceedings of the ACM Conference on Electronic Commerce. ACM, New York, 252-261.
17. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., and Shmoys, D. B. 1993. Sequencing and Scheduling: Algorithms and Complexity. Elsevier, Amsterdam, The Netherlands.
18. Lenstra, J. K., Shmoys, D. B., and Tardos, E. 1990. Approximation algorithms for scheduling unrelated parallel machines. Math. Prog. 46, 259-271.
19. Raghavan, P., and Thompson, C. D. 1987. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365-374.
20. Schuurman, P., and Woeginger, G. J. 1999. Polynomial-time approximation algorithms for machine scheduling: Ten open problems. J. Scheduling 2, 203-213.
21. Shmoys, D. B., and Tardos, E. 1993. An approximation algorithm for the generalized assignment problem. Math. Prog. 62, 461-474.
22. Skutella, M. 2001. Convex quadratic and semidefinite relaxations in scheduling. J. ACM 46, 2, 206-242.
23. Smith, W. E. 1956. Various optimizers for single-stage production. Nav. Res. Log. Q. 3, 59-66.
24. Stein, C., and Wein, J. 1997. On the existence of schedules that are near-optimal for both makespan and total weighted completion-time. Oper. Res. Lett. 21, 115-122.