An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements

Research output: Contribution to journal › Article › peer-review