Unary NP-hardness of minimizing the number of tardy jobs with deadlines (Q2398650)
From MaRDI portal
!
WARNING
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 6762257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unary NP-hardness of minimizing the number of tardy jobs with deadlines |
scientific article; zbMATH DE number 6762257 |
Statements
Unary NP-hardness of minimizing the number of tardy jobs with deadlines (English)
0 references
18 August 2017
0 references
scheduling
0 references
number of tardy jobs
0 references
deadlines
0 references
NP-hard
0 references
0 references
0 references
0 references
0 references
0.944046139717102
0 references
0.8629133701324463
0 references
0.8608303070068359
0 references
0.8322962522506714
0 references
0.8312115669250488
0 references
