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

Abstract : 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.
Type de document :
Pré-publication, Document de travail
2018
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01685395
Contributeur : Vincent T'Kindt <>
Soumis le : mardi 16 janvier 2018 - 13:16:26
Dernière modification le : mardi 9 octobre 2018 - 11:46:07
Document(s) archivé(s) le : lundi 7 mai 2018 - 21:09:36

Identifiants

  • HAL Id : hal-01685395, version 1

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

52

Téléchargements de fichiers

42