Approximation schemes for scheduling and covering on unrelated machines
From MaRDI portal
Publication:2503309
DOI10.1016/j.tcs.2006.05.025zbMath1097.68020OpenAlexW1990454708MaRDI QIDQ2503309
Paul G. Spirakis, Pavlos S. Efraimidis
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.025
Related Items
A truthful constant approximation for maximizing the minimum load on related machines, An efficient polynomial time approximation scheme for load balancing on uniformly related machines, Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints, Unrelated parallel machine scheduling -- perspectives and progress, Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs, Multipurpose machine scheduling with rejection and identical job processing times, Approximation schemes for scheduling and covering on unrelated machines, A Unified Approach to Truthful Scheduling on Related Machines, Maximizing the minimum load for selfish agents, A new approach for bicriteria partitioning problem
Cites Work
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines
- Approximation algorithms for scheduling unrelated parallel machines
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- The exact LPT-bound for maximizing the minimum completion time
- Probabilistic methods for algorithmic discrete mathematics
- An approximation algorithm for the generalized assignment problem
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Ordinal on-line scheduling for maximizing the minimum machine completion time
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Approximation schemes for scheduling and covering on unrelated machines
- Improved approximation schemes for scheduling unrelated parallel machines
- How asymmetry helps load balancing
- Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Coordination Complexity of Parallel Price-Directive Decomposition
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
