On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements

Alexander Kononov, Julia Memar, Yakov Zinder

The paper is concerned with the two-machine flow shop, where each job requires an additional resource (referred to as storage space) from the start of its first operation till the…