Convex programming for scheduling unrelated parallel machines
Minimizing total flow time and total completion time with immediate dispatching
Minimizing the flow time without migration
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Tight bounds for online vector bin packing
All-norm approximation algorithms
Journal of Algorithms
Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC ’99
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC ’05
Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC ’13
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA ’03
Journal of the ACM
Amir Epstein
Orli Waarts
Serge Plotkin
Yossi Richter
Leah Epstein
Bruce Shepherd
Online load balancing on related machines
A unified approach to scheduling on unrelated parallel machines
Multi-processor scheduling to minimize flow time with ? resource augmentation
A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems