Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of Operations Research Année : 2005

Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis

Pierre Lopez

Résumé

We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances.
Fichier principal
Vignette du fichier
ArtiguesLopezAyache.pdf (187.55 Ko) Télécharger le fichier

Dates et versions

hal-00022742 , version 1 (13-04-2006)

Identifiants

Citer

Christian Artigues, Pierre Lopez, Pierre-Dimitri Ayache. Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis. Annals of Operations Research, 2005, 138, pp.21-52. ⟨hal-00022742⟩
283 Consultations
1104 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More