We consider two supply chain scheduling problems in which s suppliers preprocess different parts of the jobs to be assembled by the manufacturer under the common sequence constraint, with the goal of minimizing the total weighted number of tardy parts and minimizing the total late work of the parts, respectively. Ren et al. (Information Processing Letter 113: 609-601, 2013) showed that both of the above two problems are unary NP-hard. But their proof is invalid. In this paper, we present a new proof of the unary NP-hardness for the same problems.

中文翻译：

---

关于两个供应链调度问题的复杂性的说明

我们认为其中两条供应链调度问题Š供应商预处理作业的不同部分由制造商共同序列约束下进行组装，以最小化迟迟部分的总加权数，并减少零件的总后期工作的目标， 分别。任等人。（Information Processing Letter 113: 609-601, 2013）表明上述两个问题都是一元NP-hard问题。但是他们的证明是无效的。在本文中，我们提出了针对相同问题的一元 NP 硬度的新证明。