Complexity of single machine scheduling subject to nonnegative inventory constraints (Q992655)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of single machine scheduling subject to nonnegative inventory constraints |
scientific article |
Statements
Complexity of single machine scheduling subject to nonnegative inventory constraints (English)
0 references
9 September 2010
0 references
machine scheduling
0 references
inventory constraints
0 references
computational complexity
0 references
strong NP-hardness
0 references
polynomial-time algorithms
0 references
0 references
0 references
0 references
0 references
