Approximation algorithms for multiprocessor scheduling under uncertainty
From MaRDI portal
Publication:613111
DOI10.1007/s00224-010-9250-2zbMath1213.68151OpenAlexW2685896946MaRDI QIDQ613111
Rajmohan Rajaraman, Guolong Lin
Publication date: 17 December 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-010-9250-2
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for multiprocessor scheduling under uncertainty
- Approximation algorithms for scheduling unrelated parallel machines
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Project scheduling under uncertainty: survey and research potentials
- Convex quadratic and semidefinite programming relaxations in scheduling
- On the Distribution of the Number of Successes in Independent Trials
- A Computational Study of the Job-Shop Scheduling Problem
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Improved Approximation Algorithms for Shop Scheduling Problems
- Allocating Bandwidth for Bursty Connections
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Bounds for Certain Multiprocessing Anomalies
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: Approximation algorithms for multiprocessor scheduling under uncertainty
