An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements (Q6497031)
From MaRDI portal
scientific article; zbMATH DE number 7842702
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements |
scientific article; zbMATH DE number 7842702 |
Statements
An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements (English)
0 references
6 May 2024
0 references
0 references
