Convex quadratic and semidefinite programming relaxations in scheduling

Journal of the ACM

Volumn 48, Issue 2, 2001, Pages 206-242

  Skutella, Martin ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithms; Convex optimization; Performance guarantee; Randomized algorithms; Scheduling theory; Unrelated machines; Worst case ratio

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION ALGORITHMS; CONVEX OPTIMIZATION; PERFORMANCE GUARANTEE; RANDOMIZED ALGORITHMS;

QUADRATIC PROGRAMMING;

EID: 0000093702     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/375827.375840     Document Type: Article

References (57)

1. AFRATI, F., BAMPIS, E., CHEKURI, C., KARGER, D., KENYON, C., KHANNA, S., MILIS, I., QUEYRANNE, M., SKUTELLA, M., STEIN, C., AND SVIRIDENKO, M. 1999. Approximation schemes for minimizing average weighted completion time with release dates. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 32-43.
2. AUSIELLO, G., CRESCENZI, P., GAMBOSI, G., KANN, V., MARCHETTI-SPACCAMELA, A., AND PROTASI, M. 1999. Complexity and Approximation. Springer-Verlag, Berlin, Germany.
3. AWERBUCH, B., KUTTEN, S., AND PELEG, D. 1992. Competitive distributed job scheduling. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (Victoria, B.C., Canada, May 4-6). ACM, New York, pp. 571-581.
4. BERTSIMAS, D., TEO, C., AND VOHRA, R. 1996. On dependent randomized rounding algorithms. In Integer Programming and Combinatorial Optimization, W. H. Cunningham, S. T. McCormick, and M. Queyranne, Eds., Lecture Notes in Computer Science, vol. 1084. Springer-Verlag, Berlin, Germany.
5. 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. F. Meyer auf der Heide and B. Monien, Eds. Lecture Notes in Computer Science, vol. 1099. Springer-Verlag, Berlin, Germany.
6. CHOR, B., AND SUDAN, M. 1998. A geometric approach to betweenness. SIAM J. Disc. Math. 11, 511-523.
7. CHUDAK, F. A. 1999. A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines. J. Sched. 2, 73-77.
8. CHUDAK, F. A., AND SHMOYS, D. B. 1999. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. J. Algor. 30, 323-343.
9. CHUNG, S. J., AND MURTY, K. G. 1981. Polynomially bounded ellipsoid algorithms for convex quadratic programming. In Nonlinear Programming, vol. 4, O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Eds. Academic Press, Orlando, Fla., pp. 439-485.
10. DENG, X., LIU, H., LONG, J., AND XIAO, B. 1990. Deterministic load balancing in computer networks. In Proceedings of the 2nd Annual IEEE Symposium on Parallel and Distributed Processing. IEEE Computer Society Press, Los Alamitos, Calif., pp. 50-57.
11. DYER, M. E., AND WOLSEY, L. A. 1990. Formulating the single machine sequencing problem with release dates as a mixed integer program. Disc. Appl. Math. 26, 255-270.
12. ENGELS, D. W., KARGER, D. R., KOLLIOPOULOS, S. G., SENGUPTA, S., UMA, R. N., AND WEIN, J. 1998. Techniques for scheduling with rejection. In Proceedings of the 6th Annual European Symposium on Algorithms. G. Bilardi, G. F. Italiano, A. Pietracaprina, and G. Pucci, Eds. Lecture Notes in Computer Science, vol. 1461. Springer, Berlin, Germany, pp. 490-501.
13. FEIGE, U., AND GOEMANS, M. X. 1995. Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems (ISTCS '95) (Tel-Aviv, Israel, Jan. 4-6). IEEE Computer Society Press, Los Alamitos, Calif., pp. 182-189.
14. FRIEZE, A., AND JERRUM, M. 1997. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18, 67-81.
15. GOEMANS, M. X. 1997a. Improved approximation algorithms for scheduling with release dates. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 591-598.
16. GOEMANS, M. X. 1997b. Semidefinite programming in combinatorial optimization. Math. Prog. 79, 143-161.
17. GOEMANS, M. X., QUEYRANNE, M., SCHULZ, A. S., SKUTELLA, M., AND WANG, Y. 2001. Single machine scheduling with release dates. SIAM J. Disc. Math., submitted for publication.
18. GOEMANS, M. X., WEIN, J., AND WILLIAMSON, D. P. 2000. A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. Op. Res. Lett. 26, 149-154.
19. 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.
20. GRAHAM, R. L., LAWLER, E. L., LENSTRA, J. K., AND RINNOOY KAN, A. H. G. 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Disc. Math. 5, 287-326.
21. GRÖTSCHEL, M., LOVÁSZ, L., AND SCHRIJVER, A. 1981. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169-197. (Corrigendum: 4 (1984), 291-295.)
22. GRÖTSCHEL, M., LOVÁSZ, L., AND SCHRIJVER, A. 1988. Geometric Algorithms and Combinatorial Optimization. Volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin.
23. HALL, L. A., SCHULZ, A. S., SHMOYS, D. B., AND WEIN, J. 1997. Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Math. Op. Res. 22, 513-544.
24. HALL, L. A., SHMOYS, D. B., AND WEIN, J. 1996. Scheduling to minimize average completion time: Off-line and on-line algorithms. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 142-151.
25. HOOGEVEEN, H., SCHUURMAN, P., AND WOEGINGER, G. J. 1998. Non-approximability results for scheduling problems with minsum criteria. In Integer Programming and Combinatorial Optimization, R. E. Bixby, E. A. Boyd, and R. Z. Ríos-Mercado, Eds. Lecture Notes in Computer Science, vol. 1412. Springer, Berlin, pp. 353-366.
26. KANN, V., KHANNA, S., AND LAGERGREN, J. 1997. On the hardness of approximating MAX k-Cut and its dual. Chicago J. Theoret. Comput. Sci. 1997-2.
27. KARGER, D., MOTWANI, R., AND SUDAN, M. 1998. Approximate graph coloring by semidefinite programming. J. ACM 45, 2 (Mar.), 246-265.
28. KAWAGUCHI, T., AND KYAN, S. 1986. Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM J. Comput. 15, 1119-1129.
29. KOZLOV, M. K., TARASOV, S. P., AND HAČIJAN, L. G. 1979. Polynomial solvability of convex quadratic programming. Soviet Math. Dok. 20, 1108-1111.
30. LAWLER, E. L., LENSTRA, J. K., RINNOOY KAN, A. H. G., AND SHMOYS, D. B. 1993. Sequencing and scheduling: Algorithms and complexity. In Logistics of Production and Inventory, Chap. 9, S. C. Graves, A. H. G. Rinnooy Kan, and P. H. Zipkin, Eds. Handbooks in Operations Research and Management Science, vol. 4. North-Holland, Amsterdam, The Netherlands, pp. 445-522.
31. LENSTRA, J. K., RINNOOY KAN, A. H. G., AND BRUCKER, P. 1977. Complexity of machine scheduling problems. Ann. Disc. Math. 1, 343-362.
32. LENSTRA, J. K., SHMOYS, D. B., AND TARDOS, E. 1990. Approximation algorithms for scheduling unrelated parallel machines. Math. Prog. 46, 259-271.
33. MAHAJAN, S., AND RAMESH, H. 1999. Derandomizing approximation algorithms based on semidefinite programming. SIAM J. Comput. 28, 1641-1663.
34. MÖHRING, R. H., SCHÄFFTER, M. W., AND SCHULZ, A. S. 1996. Scheduling jobs with communication delays: Using infeasible solutions for approximation. In Algorithms - ESA '96, J. Diaz and M. Serna, Eds. Lecture Notes in Computer Science, vol. 1136. Springer, Berlin, Germany, pp. 76-96.
35. MOTWANI, R., NAOR, J., AND RAGHAVAN, P. 1996. Randomized approximation algorithms in combinatorial optimization. In Approximation algorithms for NP-Hard Problems, Chap. 11. D. S. Hochbaum Ed. Thomson, Boston, Mass., pp. 447-481.
36. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, Mass.
37. MUNIER, A., QUEYRANNE, M., AND SCHULZ, A. S. 1998. Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. In Integer Programming and Combinatorial Optimization. R. E. Bixby, E. A. Boyd, and R. Z. Ríos-Mercado, Eds. Lecture Notes in Computer Science, vol. 1412. Springer, Berlin, Germany, pp. 367-382.
38. PAPADIMITRIOU, C. H. 1994. Computational Complexity. Addison-Wesley, Reading, Mass.
39. PAPADIMITRIOU, C. H., AND YANNAKAKIS, M. 1990. Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 19, 322-328.
40. PAPADIMITRIOU, C. H., AND YANNAKAKIS, M. 1991. Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43, 425-440.
41. PHILLIPS, C., SCHULZ, A. S., SHMOYS, D. B., STEIN, C., AND WEIN, J. 1998. Improved bounds on relaxations of a parallel machine scheduling problem. J. Combin. Opt. 1, 413-426.
42. PHILLIPS, C., STEIN, C., AND WEIN, J. 1997. Task scheduling in networks. SIAM J. Disc. Math. 10, 573-598.
43. PHILLIPS, C., STEIN, C., AND WEIN, J. 1998. Minimizing average completion time in the presence of release dates. Math. Prog. 82, 199-223.
44. RAGHAVAN, P., AND THOMPSON, C. D. 1987. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365-374.
45. SAHNI, S. 1976. Algorithms for scheduling independent tasks. J. ACM 23, 116-127.
46. SAVELSBERGH, M. W. P., UMA, R. N., AND WEIN, J. M. 1998. An experimental study of LP-based approximation algorithms for scheduling problems. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan.). ACM, New York, pp. 453-462.
47. SCHULZ, A. S., AND SKUTELLA, M. 2001a, The power of α-points in preemptive single machine scheduling. J. Scheduling, submitted for publication.
48. SCHULZ, A. S., AND SKUTELLA, M. 2001b. Scheduling unrelated machines by randomized rounding. SIAM J. Disc. Math., submitted for publication.
49. SCHUURMAN, P., AND WOEGINGER, G. J. 1999. Polynomial time approximation algorithms for machine scheduling: ten open problems. J. Sched. 2, 203-213.
50. SETHURAMAN, J., AND SOUILLANTE, M. S. 1999. Optimal scheduling of multiclass parallel machines. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, Md., Jan. 17-19). ACM, New York, pp. 963-964.
51. SHMOYS, D. B., AND TARDOS, E. 1993. An approximation algorithm for the generalized assignment problem. Math. Prog. 62, 461-474.
52. SKUTELLA, M. 1998. Approximation and Randomization in Scheduling. Ph.D. dissertation. Technische Universität Berlin, Berlin, Germany.
53. SKUTELLA, M., AND WOEGINGER, G. J. 2000. A PTAS for minimizing the total weighted completion time on identical parallel machines. Math. Oper. Res. 25, 63-75.
54. SMITH, W. E. 1956. Various optimizers for single-stage production. Nav. Res. Log. Q. 3, 59-66.
55. SVIRIDENKO, M. 1999. New applications of the pipage rounding technique. Talk given at the workshop on Approximation Algorithms for Hard Problems in Combinatorial Optimization, The Fields Institute, Toronto, Ont., Canada, Sept. 26-Oct. 1.
56. YE, Y. 1999. A .699-approximation algorithm for Max-Bisection. Manuscript.
57. ZWICK, U. 1999. Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (Atlanta, Ga., May 1-4). ACM, New York, pp. 679-687.