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
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
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
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
Polynomial time approximation schemes for general multiprocessor job shop scheduling
Journal of Algorithms
Complexity and approximation results for scheduling multiprocessor tasks on a ring
Discrete Applied Mathematics - International symposium on combinatorial optimisation
Scheduling groups of tasks with precedence constraints on three dedicated processors
Discrete Applied Mathematics
On the Complexity of Adjacent Resource Scheduling
Journal of Scheduling
Preemptive open shop scheduling with multiprocessors: polynomial cases and applications
Journal of Scheduling
Information Assurance: Dependability and Security in Networked Systems
Information Assurance: Dependability and Security in Networked Systems
Discrete Applied Mathematics
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
An efficient scheduling algorithm for the non-preemptive independent multiprocessor platform
International Journal of Grid and Utility Computing
| Hi-index | 0.89 |