Random-based scheduling new approximations and LP lower bounds

This publication has 7 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 jobs that arrive over time
  Published by Springer Nature ,1995
• Formulating the single machine sequencing problem with release dates as a mixed integer program
  Discrete Applied Mathematics, 1990
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
  SIAM Journal on Computing, 1986
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
  Published by Elsevier ,1979
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
  Published by Elsevier ,1978
• Various optimizers for single‐stage production
  Naval Research Logistics Quarterly, 1956