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

Arnaud Malapert 1 Sophie Demassey 2 Jean-Charles Régin 1
2 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Abstract : 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.
Type de document :
Rapport
2012
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00976994
Contributeur : Estelle Nivault <>
Soumis le : jeudi 10 avril 2014 - 16:08:26
Dernière modification le : samedi 17 septembre 2016 - 01:35:55
Document(s) archivé(s) le : lundi 10 avril 2017 - 11:57:43

Fichier

RR_2012-07.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00976994, version 1

Collections

Citation

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

Partager

Métriques

Consultations de
la notice

233

Téléchargements du document

168