Skip to main content
SpringerLink
Log in

A supermodular relaxation for scheduling with release dates

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 1996)

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

Abstract

We consider the scheduling problem of minimizing a weighted sum of completion times under release dates. We present a relaxation which is a supermodular polyhedron. We show that this relaxation is precisely the projection of a time-indexed relaxation introduced by Dyer and Wolsey.

Part of this work was supported by NSF contract 9302476-CCR, a Sloan Foundation Fellowship, and ARPA Contract N00014-95-1-1246.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to algorithms, McGraw Hill (1990).

    Google Scholar 

  2. 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).

    Article  Google Scholar 

  3. S. Fujishige, “Submodular functions and optimization”, Annals of Discrete Mathematics, 47, North-Holland (1991).

    Google Scholar 

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

    Google Scholar 

  5. L. Lovász, “Submodular functions and convexity”, in: A. Bachem, M. Grötschel and B. Korte (eds.), Mathematical Programming: The State of the Art, Bonn, 1982, Springer, Berlin, 235–257, 1983.

    Google Scholar 

  6. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, New York (1988).

    Google Scholar 

  7. G.L. Nemhauser, L.A. Wolsey and M.L. Fisher, “An analysis of approximations for maximizing submodular set functions — I”, Mathematical Programing, 14, 265–294 (1978).

    Article  Google Scholar 

  8. M.E. Posner, “A sequencing problem with release dates and clustered jobs”, Management Science, 32, 731–738 (1986).

    MathSciNet  Google Scholar 

  9. M. Queyranne, “Structure of a simple scheduling polyhedron”, Mathematical Programming, 58, 263–285 (1993).

    Article  Google Scholar 

  10. M. Queyranne and A. S. Schulz, “Polyhedral approaches to machine scheduling”, Preprint 408/1994, Department of Mathematics, Technical University of Berlin, Berlin, Germany, 1994.

    Google Scholar 

  11. M. Queyranne and A. S. Schulz, “Scheduling units jobs with compatible release dates on parallel machines with nonstationary speeds”, Proceedings of the 4th Integer Programming and Combinatorial Optimization Conference, E. Balas and J. Clausen, eds., Lecture Notes in Computer Science, 920, Springer-Verlag, 307–320 (1995).

    Google Scholar 

  12. A.S. Schulz, “Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds”, these proceedings, 1996.

    Google Scholar 

  13. L.S. Shapley, “Complements and substitutes in the optimal assignment problem”, Naval Research Logistics Quaterly, 9, 45–48 (1962).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, M.I.T., Room 2-382, 02139, Cambridge, MA

    Michel X. Goemans

Authors
  1. Michel X. Goemans
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

William H. Cunningham S. Thomas McCormick Maurice Queyranne

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goemans, M.X. (1996). A supermodular relaxation for scheduling with release dates. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds) Integer Programming and Combinatorial Optimization. IPCO 1996. Lecture Notes in Computer Science, vol 1084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61310-2_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-61310-2_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61310-7

  • Online ISBN: 978-3-540-68453-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation