Two NP-hardness results for preemptive minsum scheduling of unrelated parallel machines

From MaRDI portal















This page was built for publication: Two NP-hardness results for preemptive minsum scheduling of unrelated parallel machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537758)