2-approximation algorithm for a generalization of scheduling on unrelated parallel machines
From MaRDI portal
Recommendations
- Approximate algorithms for unrelated machine scheduling to minimize makespan
- Improved approximation schemes for scheduling unrelated parallel machines
- Approximation schemes for scheduling and covering on unrelated machines
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- Automata, Languages and Programming
Cites work
- Algorithm Theory - SWAT 2004
- Algorithms for Scheduling Tasks on Unrelated Processors
- All-norm approximation algorithms
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Approximation algorithms for scheduling unrelated parallel machines
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Network flows. Theory, algorithms, and applications.
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Cited in
(2)
This page was built for publication: 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799571)