Semi-normal schedulings: Improvement on Goemans' algorithm
From MaRDI portal
Recommendations
- A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors
- A simple linear-time approximation algorithm for multi-processor job scheduling on four processors
- A polynomial time approximation scheme for general multiprocessor job scheduling
- Semi-on-line multiprocessor scheduling with given total processing time
Cited in
(5)- Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
- A short note on an advance in estimating the worst-case performance ratio of the MPS algorithm
- Lower bound algorithms for multiprocessor task scheduling with ready times
- A simple linear-time approximation algorithm for multi-processor job scheduling on four processors
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors
This page was built for publication: Semi-normal schedulings: Improvement on Goemans' algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474073)