The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem
From MaRDI portal
Publication:583101
DOI10.1016/0895-7177(90)90375-WzbMath0691.90044OpenAlexW2030043850MaRDI QIDQ583101
C. C. S. Sin, Cheng, T. C. Edwin
Publication date: 1990
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(90)90375-w
NP-completenessm parallel machinesmaximum job completion timepreemptive due-date schedulingsimultaneously available jobs
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Cites Work
This page was built for publication: The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem