The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine

The problem of interest is to schedule two types of jobs on a two-stage flowshop with a common second-stage machine so as to minimize the makespan. This problem was previously known to be View the MathML source-hard in the ordinary sense. In this note, we give a proof for the strong View the MathML source-hardness.