Strong NP-hardness of scheduling problems with learning or aging effect (Q363599): Difference between revisions
From MaRDI portal
Latest revision as of 20:25, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strong NP-hardness of scheduling problems with learning or aging effect |
scientific article |
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