A simple linear-time approximation algorithm for multi-processor job scheduling on four processors
From MaRDI portal
Recommendations
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors
- A polynomial time approximation scheme for general multiprocessor job scheduling
- A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
- General multiprocessor task scheduling: approximate solutions in linear time
- Semi-normal schedulings: Improvement on Goemans' algorithm
Cited in
(3)
This page was built for publication: A simple linear-time approximation algorithm for multi-processor job scheduling on four processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472480)