A supermodular relaxation for scheduling with release dates

This publication has 9 references indexed in Scilit:

• Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
  Published by Springer Nature ,1996
• Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
  Published by Springer Nature ,1995
• Structure of a simple scheduling polyhedron
  Mathematical Programming, 1993
• Formulating the single machine sequencing problem with release dates as a mixed integer program
  Discrete Applied Mathematics, 1990
• Integer and Combinatorial Optimization
  Published by Wiley ,1988
• A Sequencing Problem with Release Dates and Clustered Jobs
  Management Science, 1986
• Submodular functions and convexity
  Published by Springer Nature ,1983
• An analysis of approximations for maximizing submodular set functions—I
  Mathematical Programming, 1978
• Complements and substitutes in the opttmal assignment problem
  Naval Research Logistics Quarterly, 1962