Combinatorial sliding window scheduling for distributed systems

We describe a fully distributed approach to scheduling within a sliding time frame or sliding window. All agents with processes inside the window schedule operations using time shifting and a combinatorial reordering algorithm. Operations outside the window need not be scheduled until either the sliding window has advanced to encompass them or until gaps have opened between tasks inside the sliding window to accommodate them.