Improved approximation schemes for scheduling unrelated parallel machines
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
Linear-time approximation schemes for scheduling malleable parallel tasks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Semi-normal Schedulings: Improvement on Goemans' Algorithm
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the Approximability of Multiprocessor Task Scheduling Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Scheduling of Independent Dedicated Multiprocessor Tasks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Scheduling to Minimize the Average Completion Time of Dedicated Tasks
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Grouping Techniques for Scheduling Problems: Simpler and Faster
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On the Complexity of Adjacent Resource Scheduling
Journal of Scheduling
Scheduling parallel jobs to minimize the makespan
Journal of Scheduling
Open block scheduling in optical communication networks
Theoretical Computer Science - Approximation and online algorithms
Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
Computers and Operations Research
A framework for designing approximation algorithms for scheduling problems
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
An efficient scheduling algorithm for the non-preemptive independent multiprocessor platform
International Journal of Grid and Utility Computing
| Hi-index | 0.00 |