The complexity of two supply chain scheduling problems (Q2444850): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2013.05.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081396989 / rank | |||
Normal rank | |||
Revision as of 20:25, 19 March 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
