Complexity of single machine scheduling subject to nonnegative inventory constraints (Q992655)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of single machine scheduling subject to nonnegative inventory constraints |
scientific article; zbMATH DE number 5781869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of single machine scheduling subject to nonnegative inventory constraints |
scientific article; zbMATH DE number 5781869 |
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
0.8868273496627808
0 references
0.8732696771621704
0 references
0.8714299201965332
0 references
0.8663996458053589
0 references
