Strong NP-hardness of scheduling problems with learning or aging effect (Q363599)
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: Strong NP-hardness of scheduling problems with learning or aging effect |
scientific article; zbMATH DE number 6203958
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong NP-hardness of scheduling problems with learning or aging effect |
scientific article; zbMATH DE number 6203958 |
Statements
Strong NP-hardness of scheduling problems with learning or aging effect (English)
0 references
3 September 2013
0 references
scheduling
0 references
flowshop
0 references
single machine
0 references
learning effect
0 references
aging effect
0 references
computational complexity
0 references
0 references
0 references
0 references
