Preprint
Aug 2026
New Complexity Results for Fair Repetitive Scheduling
This paper revisits the problem of finding fair solutions to repetitive scheduling problems with a single machine and resolves three questions and identifies several additional directions for future research.
Moran Koren, Michael L. Pinedo, D. Shabtay
· 0 citations