NP-Hardness and a PTAS for the Pinwheel Problem
Robert Kleinberg, Ahan Mishra
Published in IEEE Symposium on Foundations of Computer Science (FOCS), 2026
This paper proves NP-hardness of pinwheel scheduling (a 37 year old open problem) using new techniques and establishes a PTAS approximation algorithm, improving on the previous best which was a constant-factor approximation.
