The Deploy Log | Breakthroughs
Time-varying scheduling
Google Research introduced the first constant-factor approximation algorithms for non-preemptive throughput maximization under time-varying capacity, with a 1/2-approximation offline and a 1/11 competitive ratio online with common deadlines.
The call on this one
What shipped is free. The call on it, what to do about it and the condition on that, opens with a signup: free, no card, every edition in full.
It becomes $50 a year, and signing up now keeps your first year free.