Skip to main content
SpringerLink
Log in

Convex Quadratic Programming Relaxations for Network Scheduling Problems

  • Conference paper
  • First Online:
Algorithms - ESA’ 99 (ESA 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1643))

Included in the following conference series:

Abstract

In network scheduling a set of jobs must be scheduled on unrelated parallel processors or machines which are connected by a network. Initially, each job is located on some machine in the network and cannot be started on another machine until sufficient time elapses to allow the job to be transmitted there. This setting has applications, e. g., in distributed multi-processor computing environments and also in operations research; it can be modeled by a standard parallel machine environment with machine-dependent release dates.We consider the objective of minimizing the total weighted completion time.

The main contribution of this paper is a provably good convex quadratic programming relaxation of strongly polynomial size for this problem. Until now, only linear programming relaxations in time- or interval-indexed variables have been studied. Those LP relaxations, however, suffer from a huge number of variables. In particular, the best previously known relaxation is of exponential size and can therefore not be solved exactly in polynomial time. As a result of the convex quadratic programming approach we can give a very simple and easy to analyze randomized 2—approximation algorithm which slightly improves upon the best previously known approximation result. Furthermore, we consider pre-emptive variants of network scheduling and derive approximation results and results on the power of preemption which improve upon the best previously known results for these settings.

This research was partially supported by DONET within the frame of the TMR Programme (contract number ERB FMRX-CT98-0202) while the author was staying at C.O.R.E., Louvain-la-Neuve, Belgium, for the academic year 1998/99.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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

    Google Scholar 

  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

    MATH  MathSciNet  Google Scholar 

  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

    Google Scholar 

  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

    Google Scholar 

  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

    Article  MathSciNet  MATH  Google Scholar 

  6. M. X. Goemans. Improved approximation algorithms for scheduling with release dates. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 591–598, 1997. 128

    Google Scholar 

  7. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5:287–326, 1979. 128

    Article  MATH  MathSciNet  Google Scholar 

  8. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Mathematics of Operations Research, 22:513–544, 1997. 128

    Article  MATH  MathSciNet  Google Scholar 

  9. L. A. Hall, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: Off-line and on-line algorithms. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 142–151, 1996. 128

    Google Scholar 

  10. H. Hoogeveen, P. Schuurman, and G. J. Woeginger. Non-approximability results for scheduling problems with minsum criteria. In R. E. Bixby, E. A. Boyd, and R. Z. Ríos-Mercado, editors, Integer Programming and Combinatorial Optimization, volume 1412 of Lecture Notes in Computer Science, pages 353–366. Springer, Berlin, 1998. 137

    Chapter  Google Scholar 

  11. M. K. Kozlov, S. P. Tarasov, and L. G. Hačijan. Polynomial solvability of convex quadratic programming. Soviet Mathematics Doklady, 20:1108–1111, 1979. 134

    MATH  Google Scholar 

  12. J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343–362, 1977. 128, 129

    Article  MathSciNet  Google Scholar 

  13. R. Motwani, J. Naor, and P. Raghavan. Randomized approximation algorithms in combinatorial optimization. In D. S. Hochbaum, editor, Approximation algorithms for NP-hard problems, chapter 11, pages 447–481. Thomson, 1996. 135

    Google Scholar 

  14. C. H. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19:322–328, 1990. 130

    Article  MATH  MathSciNet  Google Scholar 

  15. C. Phillips, C. Stein, and J. Wein. Task scheduling in networks. SIAM Journal on Discrete Mathematics, 10:573–598, 1997. 128

    Article  MATH  MathSciNet  Google Scholar 

  16. C. Phillips, C. Stein, and J. Wein. Minimizing average completion time in the presence of release dates. Mathematical Programming, 82:199–223, 1998. 130

    MathSciNet  Google Scholar 

  17. P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365–374, 1987. 135

    Article  MATH  MathSciNet  Google Scholar 

  18. A. S. Schulz and M. Skutella. Scheduling-LPs bear probabilities: Randomized approximations for min-sum criteria. In R. Burkard and G. J. Woeginger, editors, Algorithms-ESA’ 97, volume 1284 of Lecture Notes in Computer Science, pages 416–429. Springer, Berlin, 1997. 128, 130, 134

    Google Scholar 

  19. J. Sethuraman and M. S. Squillante. Optimal scheduling of multiclass prallel machines. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 963–964, 1999. 129

    Google Scholar 

  20. D. B. Shmoys and É. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62:461–474, 1993. 129

    Article  MathSciNet  Google Scholar 

  21. M. Skutella. Approximation and Randomization in Scheduling. PhD thesis, Technical University of Berlin, Germany, 1998. 130

    MATH  Google Scholar 

  22. M. Skutella. Semidefinite relaxations for parallel machine scheduling. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 472–481, 1998. 129, 129, 130, 131, 132, 134, 136

    Google Scholar 

  23. M. Skutella. Convex Quadratic and Semidefinite Programming Relaxations in Scheduling. Manuscript, 1999. 130

    Google Scholar 

  24. W. E. Smith. Various optimizers for single-stage production. Naval Research and Logistics Quarterly, 3:59–66, 1956. 129

    Article  MathSciNet  Google Scholar 

Download references

Author information

Author notes

  1. Martin Skutella

    Present address: Technische Universität Berlin, Berlin

Authors and Affiliations

    Authors
    1. Martin Skutella
      View author publications

      You can also search for this author in PubMed Google Scholar

    Editor information

    Editors and Affiliations

    1. Department of Applied Mathematics and DIMATIA Centre, Charles University, Malostranská nám. 25, CZ-11800, Prague 1, Czech Republic

      Jaroslav Nešetřil

    Rights and permissions

    Reprints and permissions

    Copyright information

    © 1999 Springer-Verlag Berlin Heidelberg

    About this paper

    Cite this paper

    Skutella, M. (1999). Convex Quadratic Programming Relaxations for Network Scheduling Problems. In: Nešetřil, J. (eds) Algorithms - ESA’ 99. ESA 1999. Lecture Notes in Computer Science, vol 1643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_12

    Download citation

    • DOI: https://doi.org/10.1007/3-540-48481-7_12

    • Published:

    • Publisher Name: Springer, Berlin, Heidelberg

    • Print ISBN: 978-3-540-66251-8

    • Online ISBN: 978-3-540-48481-3

    • eBook Packages: Springer Book Archive

    Publish with us

    Policies and ethics

    Search

    Navigation