Minimizing mean flow time with release time constraint
Theoretical Computer Science
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
Approximation algorithms for scheduling
Approximation algorithms for NP-hard problems
Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh 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
Scheduling Cilk multithreaded parallel programs on processors of different speeds
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Non-clairvoyant Scheduling for Minimizing Mean Slowdown
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Maximizing job benefits on-line
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Optimal Online Flow Time with Resource Augmentation
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Minimizing total flow time and total completion time with immediate dispatching
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Online Scheduling to Minimize Average Stretch
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Average stretch without migration
Journal of Computer and System Sciences
On minimizing the total flow time on multiple machines
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
Dynamic TCP acknowledgment in the LogP model
Journal of Algorithms
SPT is optimally competitive for uniprocessor flow
Information Processing Letters
Multi-processor scheduling to minimize flow time with ε resource augmentation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A least flow-time first load sharing approach for distributed server farm
Journal of Parallel and Distributed Computing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Minimizing average flow time on related machines
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Optimal on-line flow time with resource augmentation
Discrete Applied Mathematics - Special issue: Efficient algorithms
ACM Transactions on Algorithms (TALG)
Weighted flow time does not admit O(1)-competitive algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Minimizing Average Flow Time on Unrelated Machines
Approximation and Online Algorithms
How to Balance the Load on Heterogeneous Clusters
International Journal of High Performance Computing Applications
Proceedings of the forty-first annual ACM symposium on Theory of computing
Optimal on-line flow time with resource augmentation
Discrete Applied Mathematics - Special issue: Efficient algorithms
Order scheduling models: hardness and algorithms
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Better algorithms for minimizing average flow-time on related machines
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A simpler proof of preemptive total flow time approximation on parallel machines
Efficient Approximation and Online Algorithms
Greedy multiprocessor server scheduling
Operations Research Letters
On-line scheduling to minimize max flow time: an optimal preemptive algorithm
Operations Research Letters
Minimizing flow time on a constant number of machines with preemption
Operations Research Letters
Cloud scheduling with setup cost
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |