The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem (Q583101)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4131938
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem |
scientific article; zbMATH DE number 4131938 |
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
0 references
0.8511065244674683
0 references
0.8334634304046631
0 references
