Scheduling multiprocessor tasks on three dedicated processors
Information Processing Letters
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Complexity of scheduling multiprocessor tasks with prespecified processor allocations
Discrete Applied Mathematics
An approximation algorithm for scheduling on three dedicated machines
Discrete Applied Mathematics
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
The complexity of scheduling starting time dependent tasks with release times
Information Processing Letters
Efficient approximation algorithms for scheduling malleable tasks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Linear-time approximation schemes for scheduling malleable parallel tasks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling Independent Multiprocessor Tasks
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Scheduling of Independent Dedicated Multiprocessor Tasks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On-line scheduling of scalable real-time tasks on multiprocessor systems
Journal of Parallel and Distributed Computing
Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
Computers and Operations Research
| Hi-index | 0.00 |