Open Shop Scheduling to Minimize Finish Time
Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems
Journal of the ACM (JACM)
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Improved approximation schemes for scheduling unrelated parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Algorithms for Scheduling Tasks on Unrelated Processors
Journal of the ACM (JACM)
Approximation algorithms for general parallel task scheduling
Information Processing Letters
Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Global and Local Search for Scheduling Job Shop with Parallel Machines
IBERAMIA-SBIA '00 Proceedings of the International Joint Conference, 7th Ibero-American Conference on AI: Advances in Artificial Intelligence
Task Distributions on Multiprocessor Systems
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
A heterogeneous multiprocessor design and the distributed scheduling of its task group workload
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Scheduling problems for parallel dedicated machines under multiple resource constraints
Discrete Applied Mathematics - International symposium on combinatorial optimisation
SCHEDULING OF AN INPUT-QUEUED SWITCH TO ACHIEVE MAXIMAL THROUGHPUT
Probability in the Engineering and Informational Sciences
Off-Line Scheduling of Divisible Requests on an Heterogeneous Collection of Databanks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Complexity of preemptive minsum scheduling on unrelated parallel machines
Journal of Algorithms
Scheduling algorithms for procrastinators
Journal of Scheduling
Improved approximations for multiprocessor scheduling under uncertainty
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Minimizing the stretch when scheduling flows of divisible requests
Journal of Scheduling
Preemptive scheduling on uniform machines to minimize mean flow time
Computers and Operations Research
Integrality Property in Preemptive Parallel Machine Scheduling
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Complexity of preemptive minsum scheduling on unrelated parallel machines
Journal of Algorithms
A survey of scheduling with deterministic machine availability constraints
Computers and Industrial Engineering
Genetic branch-and-bound or exact genetic algorithm?
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
On the max-weight edge coloring problem
Journal of Combinatorial Optimization
Algorithms and theory of computation handbook
Parallel machine problems with equal processing times: a survey
Journal of Scheduling
On the configuration-LP for scheduling on unrelated machines
ESA'11 Proceedings of the 19th European conference on Algorithms
Robust algorithms for preemptive scheduling
ESA'11 Proceedings of the 19th European conference on Algorithms
Tabu search and lower bound for an industrial complex shop scheduling problem
Computers and Industrial Engineering
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
Scheduling open shops with parallel machines
Operations Research Letters
Minimizing the number of late jobs on unrelated machines
Operations Research Letters
Two-machine open shop scheduling with an availability constraint
Operations Research Letters
On-line scheduling to minimize max flow time: an optimal preemptive algorithm
Operations Research Letters
An improved approximation algorithm for the partial Latin square extension problem
Operations Research Letters
| Hi-index | 0.00 |