An exact method for the best case in a group sequence: Application to a general shop problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

An exact method for the best case in a group sequence: Application to a general shop problem

Résumé

Group sequencing is a well-studied scheduling method for the job shop problem. The goal of this method is to have a sequential flexibility during the execution of the schedule and to guarantee a minimal quality corresponding to the worst case. But the best case quality of a group sequence should also be interesting. This article presents new methods to evaluate the best case quality for any regular objective function. More particularly, three new makespan lower bounds are presented. The experiments performed with these lower bounds exhibit very good performances.
Fichier principal
Vignette du fichier
pinot2009exact.pdf (401.22 Ko) Télécharger le fichier
pinot2009exact-handout.pdf (291.44 Ko) Télécharger le fichier
pinot2009exact-pres.pdf (541.62 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Format : Autre
Format : Autre

Dates et versions

hal-00410125 , version 1 (17-08-2009)

Identifiants

  • HAL Id : hal-00410125 , version 1

Citer

Guillaume Pinot, Mebarki Nasser. An exact method for the best case in a group sequence: Application to a general shop problem. 13th IFAC Symposium on Information Control Problems in Manufacturing, Jun 2009, Moscou, Russia. pp.1269-1274. ⟨hal-00410125⟩
112 Consultations
288 Téléchargements

Partager

Gmail Facebook X LinkedIn More