Unary NP-hardness of minimizing the number of tardy jobs with deadlines (Q2398650)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Unary NP-hardness of minimizing the number of tardy jobs with deadlines |
scientific article |
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