Abstract: Disclosed in some examples, are systems, methods, and machine readable mediums which implement a scalable algorithm for scheduling promotional campaigns of an online service that satisfy a set of desired constraints while at the same time maximizing a total utility. This algorithm is capable of scheduling hundreds of campaigns for millions of members. In some examples, each promotional campaign may have a utility (which may be described by a utility function) for a particular member and a goal of the scheduling algorithm may be to maximize the total utility for all members eligible for the promotional campaign while satisfying various constraints.