Pré-Publication, Document De Travail Année : 2018

Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes

Résumé

We consider a time-indexed formulation for the unrelated parallel machine scheduling problem. We show that all polyhedral knowledge known from the single machine problem (in particular, valid inequalities) is applicable to this formulation. We present new facet-inducing valid inequalities and a preprocessing technique involving fixing variables based on reduced costs. We combine both techniques in a basic cutting-plane algorithm and test the performance of the resulting algorithm by running it on randomly generated instances.

Fichier principal
Vignette du fichier
FinalVersion.pdf (382.36 Ko) Télécharger le fichier
instances.zip (117.1 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-01685395 , version 1 (16-01-2018)

Licence

Identifiants

  • HAL Id : hal-01685395 , version 1

Citer

Lotte Berghman, Frits Spieksma, Vincent T'kindt. Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes. 2018. ⟨hal-01685395⟩
221 Consultations
673 Téléchargements

Partager

  • More