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

Christian Artigues 1 Pierre Lopez 2 Pierre-Dimitri Ayache 1
2 LAAS-MOGISA
LAAS - Laboratoire d'analyse et d'architecture des systèmes [Toulouse]
Abstract : 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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00022742
Contributor : Pierre Lopez <>
Submitted on : Thursday, April 13, 2006 - 1:36:47 PM
Last modification on : Friday, June 14, 2019 - 6:31:02 PM
Long-term archiving on : Saturday, April 3, 2010 - 9:35:12 PM

Identifiers

Citation

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, Springer Verlag, 2005, 138, pp.21-52. ⟨hal-00022742⟩

Share

Metrics

Record views

392

Files downloads

869