# Equitable Scheduling on a Single Machine

arXiv: https://arxiv.org/abs/2010.04643 · HTML: https://mlsanity.com/paper/2010.04643/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 9 Oct 2020.

## Built on by (most cited first, 1 of 1)

- [A Structural Complexity Analysis of Hierarchical Task Network Planning](https://mlsanity.com/paper/2401.14174/) (2024)

## Abstract (arXiv)

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 ≤ 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.