The NP-completeness of the n/m/parallel/C_ preemptive due-date scheduling problem
From MaRDI portal
Publication:583101
Recommendations
- Two NP-hardness results for preemptive minsum scheduling of unrelated parallel machines
- scientific article; zbMATH DE number 232395
- Preemptive scheduling with deadlines on parallel machines
- scientific article; zbMATH DE number 969090
- A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
Cites work
Cited in
(4)
This page was built for publication: The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583101)