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.90044MaRDI QIDQ583101
Cheng, T. C. Edwin, C. C. S. Sin
Publication date: 1990
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
NP-completeness; m parallel machines; maximum job completion time; preemptive due-date scheduling; simultaneously available jobs
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
Related Items
Cites Work