An Efficient Best Response Heuristic for a Non-preemptive Strictly Periodic Scheduling Problem

We propose an enhanced version of a original heuristic first proposed in [ 1 , 2 ] to solve a NP-hard strictly periodic scheduling problem. Inspired by game theory, the heuristic reaches an equilibrium by iteratively solving best response problems. Our contribution is to greatly improve its efficiency, taking advantage of the two-dimensionality of the best response problem. The results show that the new heuristic compares favorably with MILP solutions.