In this paper, we study single-machine scheduling problems with due dates, positional due indices, deadlines and positional deadlines. The scheduling criteria studied in this paper include the number of position-violated tasks, the weighted number of position-violated tasks, and the maximum positional lateness of tasks, by also combining with other traditional scheduling criteria. For each problem, we either provide a polynomial-time algorithm or present an NP-hardness proof.

中文翻译：

---

具有位置到期索引和位置截止日期的单机调度

在本文中，我们研究具有到期日，位置到期索引，截止日期和位置截止日期的单机调度问题。本文研究的调度准则还包括与其他传统调度准则相结合的位置违规任务的数量，位置违规任务的加权数量以及最大位置迟到任务。对于每个问题，我们要么提供多项式时间算法，要么提出NP硬度证明。