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

Simple item page
dc.creatorArtigues, Christian
dc.creatorLopez, Pierre
dc.creatorAyache, Pierre-Dimitri
dc.date2006-06-09
dc.date.accessioned2026-07-07T07:13:02Z
dc.date.available2026-07-07T07:13:02Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cs/0606043
dc.identifierhttp://arxiv.org/abs/cs/0606043
dc.identifierAnnals of Operations Research 138 (2005) 21-52
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112298
dc.subjectComputational Complexity
dc.subjectCombinatorics
dc.titleSchedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis
dc.typetext

Files

Collections

arXiv