A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering

In the covering version of the pinwheel scheduling problem, a daily task must be assigned to agents under the constraint that agent $i$ can perform the task at most once in any $a_i$-day interval. In this paper, we determine the optimal constant ${\alpha }^{\ast }=1.264\dots$ such that every instance with ${\sum }_i\frac{1}{a_i}\ge {\alpha }^{\ast }$ is schedulable. This resolves an open problem posed by Soejima and Kawamura (2020). Our proof combines Kawamura’s (2024) techniques for the packing version with new mathematical insights, along with an exhaustive computer-aided search that draws on some ideas from Gąsieniec, Smith, and Wild (2022).