论文标题
一台计算机上的公平安排
Equitable Scheduling on a Single Machine
论文作者
论文摘要
我们引入了对在单台机器上安排作业问题的自然但似乎尚未研究的概括，以最大程度地减少迟到的作业数量。我们的概括在于同时考虑该问题的几个实例。特别是，我们在$ m $天的时间内拥有$ n $的客户，每个客户每天都有一项工作时间和截止日期。我们的目标是为$ M $天数提供时间表，以便保证每个客户的工作截止日期至少在$ k \ le m $天。这对应于公平的时间表，在该时间表中，每个客户在整个$ M $天数中的服务水平最低。我们对该问题的三个主要变体的计算复杂性进行了彻底的分析，从而确定了有效的算法和最坏情况下的棘手性结果。
We introduce a natural but seemingly yet unstudied generalization of the problem of scheduling jobs on a single machine so as to minimize the number of tardy jobs. Our generalization lies in simultaneously considering several instances of the problem at once. In particular, we have $n$ clients over a period of $m$ days, where each client has a single job with its own processing time and deadline per day. Our goal is to provide a schedule for each of the $m$ days, so that each client is guaranteed to have their job meet its deadline in at least $k \le m$ days. This corresponds to an equitable schedule where each client is guaranteed a minimal level of service throughout the period of $m$ days. We provide a thorough analysis of the computational complexity of three main variants of this problem, identifying both efficient algorithms and worst-case intractability results.
