We consider scheduling problems such that the due date is assigned to a job, depending on its position, and the intervals between consecutive due dates are identical. The objective is to minimize the weighted number of tardy jobs or the total weighted tardiness. Both two-machine flow shop and single-machine cases are considered. We establish the computational complexity of each case, based on the relationship with the scheduling problem with a common due date.

中文翻译：

---

在单机和两机环境下按广义和定期到期日期进行计划

我们考虑调度问题，以便根据作业的位置将到期日分配给作业，并且连续到期日之间的间隔是相同的。目的是最大程度地减少加权工作的加权数量或总加权延迟。同时考虑了两机流水车间和单机箱。我们基于与具有共同到期日的调度问题的关系来确定每种情况的计算复杂性。