An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements. - Alexander V. Kononov; Marina Pakulich (J. Comb. Optim., 2024)