PINWHEEL SCHEDULING WITH 2 DISTINCT NUMBERS

The Pinwheel is a real-time scheduling problem based on a problem in scheduling satellite ground stations but which also addresses scheduling preventive maintenance. Given a multiset of positive integers A = {a1,a2,...,a(n)}, a schedule S for A is an infinite sequence over {1,2,...,n} such that any subsequence of length a(i) (1 less-than-or-equal-to i less-than-or-equal-to n) contains at least one i. Schedules can always be made cyclic; that is, a segment can be found that can be repeated indefinitely to form an infinite schedule. Interesting questions include determining whether schedules exist, determining the minimum cyclic schedule length, and creating an online scheduler. The "density" of an instance is defined as d = SIGMA(i = 1)n 1/a(i). It has been shown that any instance with d > 1.0 cannot be scheduled. In the present paper we limit ourselves to instances in which A contains elements having only two distinct values. We prove that all such instances with d less-than-or-equal-to 1.0 can be scheduled, using a scheduling strategy based on balancing. The schedule so created is not always of minimum length, however. We use a related but more complicated method to create a minimum-length cyclic schedule, and prove its correctness. The former is computationally easier to obtain but not necessarily minimal. The latter, although still obtainable in polynomial time, requires significantly more computation. In addition, we show how to use either method to produce a fast online schedule. Thus, we have solved completely the three major problems for this class of instances.