Batch scheduling and common due date assignment problem: An NP-hard case

An important special case of the problem studied in Cheng and Kovalyov (1996) arises when there are equal set-up times and equal job processing times. Computational complexity of this case was indicated to be open, however. I prove its NP-hardness.