Items in a sequence are associated with items in a set of items to be visited, such as data objects stored by a data storage system. A scheduling algorithm schedules visitation of the items in a manner that is stateless, so that items can be removed or added to the set without affecting previously scheduled visitations of the remaining items. The scheduling algorithm also spreads visitations among the items in a manner that prevents visitations from being focused on clusters of the items.