On the existence of schedules that are near-optimal for both makespan and total weighted completion time

This publication has 16 references indexed in Scilit:

• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
  Published by Elsevier ,1999
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
  Journal of Algorithms, 1996
• Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
  Mathematics of Operations Research, 1996
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
  SIAM Journal on Computing, 1988
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
  Mathematics of Operations Research, 1988
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
  SIAM Journal on Computing, 1986
• The complexity of the travelling repairman problem
  RAIRO - Theoretical Informatics and Applications, 1986
• 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
• Bounds for Certain Multiprocessing Anomalies
  Bell System Technical Journal, 1966