scientific article; zbMATH DE number 1894930
From MaRDI portal
Publication:4801952
zbMATH Open1026.90045MaRDI QIDQ4801952FDOQ4801952
Publication date: 8 April 2003
Title of this publication is not available (Why is that?)
Recommendations
- Approximation algorithms for scheduling unrelated parallel machines
- Randomized On-line Scheduling of Parallel Jobs
- Approximation schemes for scheduling on parallel machines
- Publication:4942231
- scientific article; zbMATH DE number 947476
- Approximation results in parallel machines stochastic scheduling
- Barely random algorithms for multiprocessor scheduling
- Approximating scheduling unrelated parallel machines in parallel
Cited In (7)
- Title not available (Why is that?)
- Scheduling Unrelated Machines by Randomized Rounding
- Randomized on-line and semi-on-line scheduling on identical machines
- A lower bound for randomized on-line scheduling algorithms
- New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization
- Title not available (Why is that?)
- Parallel execution of schedules with random dependency graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4801952)