An efficient best response heuristic for a non-preemptive strictly periodic scheduling problem

Clément Pira (1) , Christian Artigues (1)

1 LAAS-MOGISA

We propose an enhanced version of a original heuristic first proposed in Al Sheikh (2011) to solve a NP-hard strictly periodic scheduling prob- lem. 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.

Mots clés: Periodic scheduling; equilibrium; twodimensional optimization

Domaines: Recherche opérationnelle [math.OC]

Clément Pira, Christian Artigues. An efficient best response heuristic for a non-preemptive strictly periodic scheduling problem. Learning and Intelligent OptimizatioN Conference LION 7, Jan 2013, Catania, Italy. pp.281-287, ⟨10.1007/978-3-642-44973-4_30⟩. ⟨hal-00761345⟩