Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds

This publication has 19 references indexed in Scilit:

• Improved scheduling algorithms for minsum criteria
  Published by Springer Nature ,1996
• Formulating the single machine sequencing problem with release dates as a mixed integer program
  Discrete Applied Mathematics, 1990
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
  SIAM Journal on Computing, 1988
• Geometric Algorithms and Combinatorial Optimization
  Published by Springer Nature ,1988
• 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
• Flowshop and Jobshop Schedules: Complexity and Approximation
  Operations Research, 1978
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
  Published by Elsevier ,1978
• The Complexity of Flowshop and Jobshop Scheduling
  Mathematics of Operations Research, 1976
• Scheduling independent tasks to reduce mean finishing time
  Communications of the ACM, 1974