Reproduce “New Complexity Results for Fair Repetitive Scheduling” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Moran Koren, Michael L. Pinedo, Dvir Shabtay
The authors study fair scheduling of one daily job per client on a single machine, minimizing the largest cumulative client penalty. They ask whether a schedule can keep every client’s total below a common cap, and reduce Partition to this decision problem. The reductions show weak NP-hardness for three-day completion time and two-day waiting time, even when daily processing times are identical in the latter case.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.