The complexity of two supply chain scheduling problems (Q2444850): Difference between revisions
From MaRDI portal
Latest revision as of 14:15, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity of two supply chain scheduling problems |
scientific article |
Statements
The complexity of two supply chain scheduling problems (English)
0 references
11 April 2014
0 references
computational complexity
0 references
manufacturing and scheduling
0 references
supply chains
0 references
NP-complete
0 references