Scheduling of conditional executed jobs on unrelated processors
From MaRDI portal
Publication:1897352
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A Linear Recognition Algorithm for Cographs
- Approximation algorithms for combinatorial problems
- Approximation algorithms for scheduling unrelated parallel machines
- Efficient probabilistically checkable proofs and applications to approximations
- NP-complete scheduling problems
- On a property of the class of n-colorable graphs
- On the hardness of approximating minimization problems
- Scheduling of conditional executed jobs on unrelated processors
This page was built for publication: Scheduling of conditional executed jobs on unrelated processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897352)