@TechReport{Dartmouth:TR96-295,
  author = {Clifford Stein and Joel Wein},
  title = {{On the Existence of Schedules that are Near-Optimal for both Makespan and Total Weighted Completion time}},
  institution = {Dartmouth College, Computer Science},
  address = {Hanover, NH},
  number = {PCS-TR96-295},
  year = {1996},
  month = {July},
  URL = {http://www.cs.dartmouth.edu/reports/TR96-295.ps.Z},
  abstract = {
    We give a simple proof that, for any instance of 
    a  very general class of scheduling problems,  there 
    exists a schedule of makespan at most twice that of the
    optimal possible and of total weighted completion time
    at most twice that of the optimal possible. We then
    refine the analysis, yielding variants of this theorem
    with improved constants, and give some algorithmic consequences of 
    the technique.
  }
}