Using Approximation within Constraint Programming to Solve the Parallel Machine Scheduling Problem with Additional Unit Resources - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Conference Papers Proceedings of the AAAI Conference on Artificial Intelligence Year : 2020

Using Approximation within Constraint Programming to Solve the Parallel Machine Scheduling Problem with Additional Unit Resources

Abstract

In this paper, we consider the Parallel Machine Scheduling Problem with Additional Unit Resources, which consists in scheduling a set of n jobs on m parallel unrelated machines and subject to exactly one of r unit resources. This problem arises from the download of acquisitions from satellites to ground stations. We first introduce two baseline constraint models for this problem. Then, we build on an approximation algorithm for this problem, and we discuss about the efficiency of designing an improved constraint model based on these approximation results. In particular, we introduce new constraints that restrict search to executions of the approximation algorithm. Finally, we report experimental data demonstrating that this model significantly outperforms the two reference models.
Fichier principal
Vignette du fichier
AAAI_2020 (4).pdf (355.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02907067 , version 1 (30-07-2020)

Identifiers

Cite

Arthur Godet, Xavier Lorca, Emmanuel Hébrard, Gilles Simonin. Using Approximation within Constraint Programming to Solve the Parallel Machine Scheduling Problem with Additional Unit Resources. Thirty-Fourth AAAI Conferance on Artificial Intelligence (AAAI'20), Feb 2020, New-York, United States. pp.1512-1519, ⟨10.1609/aaai.v34i02.5510⟩. ⟨hal-02907067⟩
104 View
10 Download

Altmetric

Share

Gmail Facebook X LinkedIn More