Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis

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.

Weighted Tardiness Minimization in Job Shops with Setup Times by Hybrid Genetic Algorithm

“…To build schedules we have used the Serial Schedule Generation Schema (SSGS) proposed in [1] for the SDST-JSP. SSGS iterates over the operations in the chromosome sequence and assigns each one the earliest starting time that satisfies all constraints with respect to previously scheduled operations.…”

“…SSGS iterates over the operations in the chromosome sequence and assigns each one the earliest starting time that satisfies all constraints with respect to previously scheduled operations. SSGS produces active schedules, provided that the triangular inequality for the setup times holds for all operations requiring the same machine [1], and this is the case in the instances used in our experimental study. When combined with GA, TS is applied to every schedule produced by SSGS.…”

“…Incorporating sequence-dependent setup times changes the nature of scheduling problems, so well-known results and techniques for the JSP are not directly applicable to the SDST-JSP. Some extensions have been done for makespan minimization in [1,6,13].…”

Parallel machine scheduling with precedence constraints and setup times

“…We take criterion EST because it is intuitively compatible with the minimization of setup times which has globally a positive impact for minimization of other regular criteria (Artigues et al, 2005). In case of tie between two jobs, we apply SPT (Smallest Processing Time) rule for min C i and EDD (Earliest Due Date) for min L max .…”

Combining Metaheuristics for the Job Shop Scheduling Problem with Sequence Dependent Setup Times

“…In [17] two more extensions of the G&T schedule generation scheme are proposed, one of them is not complete either, and the other is complete but it is very time consuming due to it needs to do backtracking. In any case, the lack of completeness of a decoding algorithm is not a serious problem in the framework of GAs due to a GA itself is not complete.…”