A Branch-and-Price Algorithm for Scheduling Observations on a Telescope - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

A Branch-and-Price Algorithm for Scheduling Observations on a Telescope

Résumé

We address a parallel machine scheduling problem for which the objective is to maximize the weighted number of scheduled tasks, and with the special constraint that each task has a mandatory processing instant. This problem arises, in our case, to schedule a set of astronomical observations on a telescope. We prove that the problem is NP-complete, and we propose a constraint- programming-based branch-and-price algorithm to solve it. Experiments on real and realistic datasets show that the method provides optimal solutions very efficiently.
Fichier non déposé

Dates et versions

hal-01381636 , version 1 (14-10-2016)

Identifiants

  • HAL Id : hal-01381636 , version 1

Citer

Nicolas Catusse, Hadrien Cambazard, Nadia Brauner, Pierre Lemaire, Bernard Penz, et al.. A Branch-and-Price Algorithm for Scheduling Observations on a Telescope. Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16), Jul 2016, New-York, United States. pp.3060-3066. ⟨hal-01381636⟩
114 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More