Computer Science – Computational Complexity
Scientific paper
2006-06-09
Annals of Operations Research 138 (2005) 21-52
Computer Science
Computational Complexity
Scientific paper
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.
Artigues Christian
Ayache Pierre-Dimitri
Lopez Pierre
No associations
LandOfFree
Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-409790