On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems

This publication has 13 references indexed in Scilit:

• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
  Mathematics of Operations Research, 1997
• Scheduling-LPs bear probabilities randomized approximations for min-sum criteria
  Published by Springer Nature ,1997
• Random-based scheduling new approximations and LP lower bounds
  Published by Springer Nature ,1997
• Scheduling jobs that arrive over time
  Published by Springer Nature ,1995
• Scheduling with release dates on a single machine to minimize total weighted completion time
  Discrete Applied Mathematics, 1992
• Formulating the single machine sequencing problem with release dates as a mixed integer program
  Discrete Applied Mathematics, 1990
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time
  Discrete Applied Mathematics, 1983
• Scheduling of a single machine to minimize total weighted completion time subject to release dates
  Naval Research Logistics Quarterly, 1982
• Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
  SIAM Journal on Computing, 1981
• Bounds for the Optimal Scheduling of n Jobs on m Processors
  Management Science, 1964