Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Minimizing the flow time without migration
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
An experimental study of LP-based approximation algorithms for scheduling problems
Proceedings of the ninth 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
Off-line admission control for general scheduling problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Scheduling jobs before shut-down
Nordic Journal of Computing
Adaptive Scheduling for Master-Worker Applications on the Computational Grid
GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Task Distributions on Multiprocessor Systems
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Minimizing total flow time and total completion time with immediate dispatching
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Consistent load balancing via spread minimization
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An approximation algorithm for scheduling two parallel machines with capacity constraints
Discrete Applied Mathematics
Average stretch without migration
Journal of Computer and System Sciences
Approximation schemes for scheduling and covering on unrelated machines
Theoretical Computer Science
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
Theoretical Computer Science - Approximation and online algorithms
Fundamenta Informaticae
Approximation algorithms for multiprocessor scheduling under uncertainty
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Parallel machine scheduling problems with proportionally deteriorating jobs
International Journal of Systems Science
Reliability versus performance for critical applications
Journal of Parallel and Distributed Computing
A framework for designing approximation algorithms for scheduling problems
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Algorithms and theory of computation handbook
Scheduling on unrelated machines under tree-like precedence constraints
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
The lovász-local-lemma and scheduling
Efficient Approximation and Online Algorithms
A tight upper bound for the k-partition problem on ideal sets
Operations Research Letters
| Hi-index | 0.00 |