Beyond Cmax: an optimization-oriented framework for constraint-based scheduling

Arnaud Malapert (1) , Sophie Demassey (2) , Jean-Charles Régin (1)

1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe CEP
2 TASC - Theory, Algorithms and Systems for Constraints

This paper presents a framework taking advantage of both the flexibility of constraint programming and the efficiency of operations research algorithms for solving scheduling problems under various objectives and constraints. Built upon a constraint programming engine, the framework allows the use of scheduling global constraints, and it offers, in addition, a modular and simplified way to perform optimality reasoning based on well-known scheduling relaxations. We present a first instantiation on the single machine problem with release dates and lateness minimization. Beyond the simplicity of use, the ptimizationoriented framework appears to be, from the experiments, effective for dealing with such a pure problem even without any ad-hoc heuristics.

Mots clés: Combinatorial optimization; Artificial intelligence; Constraints satisfaction; Scheduling

Domaines: Recherche opérationnelle [math.OC]

Arnaud Malapert, Sophie Demassey, Jean-Charles Régin. Beyond Cmax: an optimization-oriented framework for constraint-based scheduling. 2012. ⟨hal-00976994⟩