A note on the complexity of family scheduling to minimize the number of late jobs (Q5946721)
From MaRDI portal
scientific article; zbMATH DE number 1659468
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the complexity of family scheduling to minimize the number of late jobs |
scientific article; zbMATH DE number 1659468 |
Statements
A note on the complexity of family scheduling to minimize the number of late jobs (English)
0 references
14 October 2001
0 references
family scheduling
0 references
number of lage jobs
0 references
strong NP-hardness
0 references
0 references
