Approximability and nonapproximability results for minimizing total flow time on a single machine
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Minimizing the flow time without migration
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation techniques for average completion time scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Scheduling to minimize average stretch without migration
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Maximizing job benefits on-line
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Minimizing total flow time and total completion time with immediate dispatching
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Average stretch without migration
Journal of Computer and System Sciences
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Why flow-completion time is the right metric for congestion control
ACM SIGCOMM Computer Communication Review
Minimizing total completion time on uniform machines with deadline constraints
ACM Transactions on Algorithms (TALG)
Approximating total flow time on parallel machines
Journal of Computer and System Sciences
Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Competitive Two-Agent Scheduling and Its Applications
Operations Research
SRPT is 1.86-competitive for completion time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A simpler proof of preemptive total flow time approximation on parallel machines
Efficient Approximation and Online Algorithms
Online cooperative cost sharing
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Polynomial algorithm for parallel machine mean flow time scheduling problem with release dates
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
A class of on-line scheduling algorithms to minimize total completion time
Operations Research Letters
Minimizing flow time on a constant number of machines with preemption
Operations Research Letters
Completion time scheduling and the WSRPT algorithm
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 5.23 |