A note on the complexity of two supply chain scheduling problems (Q2059093)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7443704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the complexity of two supply chain scheduling problems |
scientific article; zbMATH DE number 7443704 |
Statements
A note on the complexity of two supply chain scheduling problems (English)
0 references
13 December 2021
0 references
scheduling
0 references
supply chains
0 references
computational complexity
0 references
unary NP-hardness
0 references
0.935293197631836
0 references
0.7985901236534119
0 references
0.7816912531852722
0 references
