Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis
<|reference_start|>Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis: 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.<|reference_end|>
@article{artigues2006schedule,
    title={Schedule generation schemes for the job-shop problem with
  sequence-dependent setup times: dominance properties and computational
  analysis},
    author={Christian Artigues (LIA), Pierre Lopez (LAAS), Pierre-Dimitri Ayache
  (LIA)},
    journal={Annals of Operations Research 138 (2005) 21-52},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0606043},
    primaryClass={cs.CC math.CO}
}