Technical Report Number
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.
Dartmouth Digital Commons Citation
Stein, Cliff and Wein, Joel, "On the Existence of Schedules that are Near-Optimal for both Makespan and Total Weighted Completion time" (1996). Computer Science Technical Report PCS-TR96-295. https://digitalcommons.dartmouth.edu/cs_tr/137