On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements (Q2149603)
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: On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements |
scientific article |
Statements
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements (English)
0 references
29 June 2022
0 references
flow shop
0 references
computational complexity
0 references
makespan
0 references
job-dependent storage requirements
0 references
0 references
0 references
0 references
0.871935248374939
0 references
0.8426334857940674
0 references
0.820716142654419
0 references
0.7953692674636841
0 references
0.7880933284759521
0 references
