The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem (Q583101): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Cheng, T. C. Edwin / rank | |||
Normal rank | |||
Revision as of 23:02, 9 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem |
scientific article |
Statements
The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem (English)
0 references
1990
0 references
preemptive due-date scheduling
0 references
NP-completeness
0 references
simultaneously available jobs
0 references
m parallel machines
0 references
maximum job completion time
0 references
