Best-case lower bounds in a group sequence for the job 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.
Domaines
Recherche opérationnelle [math.OC]
Fichier principal
pinot2008bestcase.pdf (232.76 Ko)
Télécharger le fichier
pinot2008bestcase-handout.pdf (361.6 Ko)
Télécharger le fichier
pinot2008bestcase-pres.pdf (642.29 Ko)
Télécharger le fichier
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
| Format | Autre |
|---|
| Format | Autre |
|---|