I built a board of 1,000 tiles where anyone can pay to take a tile away from whoever currently holds it. Tiles are sorted by "heat" — a value that decays over time — so the board reorders itself continuously. The obvious way to do that is a scheduled job that recomputes every row on a timer.

Source: [Dev.to](https://dev.to/deland/ranking-by-exponential-decay-without-a-cron-job-4ifp)

Sponsored