Propagation of Idle Times Costs for Fixed Job Scheduling - ENAC - École nationale de l'aviation civile Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Propagation of Idle Times Costs for Fixed Job Scheduling

Ruixin Wang
  • Fonction : Auteur
  • PersonId : 1035768
Nicolas Barnier


—We present a new global constraint to propagate idle times costs for the Fixed Job Scheduling (FJS) problem, in particular to minimize their variance so as to optimize the robustness of solutions w.r.t. schedule deviations. The propagation of this constraint is based on the computation of the shortest path in the compatibility directed acyclic graph of each resource to obtain an exact lower bound. It ensures Bound Consistency on the resource cost in polynomial time, as well as the filtering of the resource variables associated with compatible tasks. We show on tailored FJS problems and real instances of the airport Gate Allocation Problem (a variant of the FJS problem) that this new constraint provides significant improvements in terms of number of backtracks and computation time, up to orders of magnitude in some cases.
Fichier principal
Vignette du fichier
ictai2018.pdf (323.79 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01859777 , version 1 (22-08-2018)



Ruixin Wang, Nicolas Barnier. Propagation of Idle Times Costs for Fixed Job Scheduling. ICTAI 2018, 30th International Conference on Tools with Artificial Intelligence, Nov 2018, Volos, Greece. pp.ISBN: 978-1-5386-7450-5, ⟨10.1109/ICTAI.2018.00113⟩. ⟨hal-01859777⟩


142 Consultations
196 Téléchargements



Gmail Mastodon Facebook X LinkedIn More