Optimal time-critical scheduling via resource augmentation (extended abstract)
On the existence of schedules that are near-optimal for both makespan and total weighted completion time
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC ’97
Operations Research Letters
Joel Wein
Cynthia A. Phillips
Eric Torng
A unified approach to scheduling on unrelated parallel machines
Multi-processor scheduling to minimize flow time with ? resource augmentation