Improved scheduling algorithms for minsum criteria

This publication has 10 references indexed in Scilit:

• Resource scheduling for parallel database and scientific applications
  Published by Association for Computing Machinery (ACM) ,1996
• Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
  Published by Springer Nature ,1996
• Improved Approximation Algorithms for Shop Scheduling Problems
  SIAM Journal on Computing, 1994
• A Computational Study of the Job-Shop Scheduling Problem
  INFORMS Journal on Computing, 1991
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
  Mathematics of Operations Research, 1983
• Open Shop Scheduling to Minimize Finish Time
  Journal of the ACM, 1976
• Bounds for Multiprocessor Scheduling with Resource Constraints
  SIAM Journal on Computing, 1975
• Scheduling independent tasks to reduce mean finishing time
  Communications of the ACM, 1974
• Technical Note—Minimizing Average Flow Time with Parallel Machines
  Operations Research, 1973
• Various optimizers for single‐stage production
  Naval Research Logistics Quarterly, 1956