We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set of elementary operations to be processed on different machines. The objective pursued is to minimize the completion time of the set of operations. We investigate a relaxation of the problem related to the traveling salesman pro...

This paper deals with the job-shop scheduling problem with sequence-dependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The method is based on iterative solving via branch and bound decisional versions of the problem. At each node of the branch and bound tree, constraint propagation algorithms adapted to setup times are performed for domain f...

1 Summary: This paper deals with lot sizing and scheduling for a single-stage production system where setup costs and times are sequence dependent. A large bucket mixed integer programming (MIP) model is formulated which considers only eecient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and eeciently. Furthermore, it will become cl...

Please cite this article in press as: Ciavotta, M., e prehensive study. European Journal of Operatio The permutation flowshop scheduling problem has been thoroughly studied in recent decades, both from single objective as well as frommulti-objective perspectives. To the best of our knowledge, little has been done regarding the multi-objective flowshop with Pareto approach when sequence dependen...

This paper considers a flowshop scheduling problem of a manufacturing cell that contains families of jobs whose setup times are dependent on the manufacturing ............ sequence of the families. Two objectives, namely the makespan and total flow time, have been considered simultaneously in this work. Since minimization of each of these two objectives is an NpHard problem, a Multi-Objective G...

This paper presents a new heuristic named GAPH based on a structural property for minimizing makespan in no-wait flowshop with sequence-dependent setup times. Experimental results demonstrate the superiority of the proposed approach over thhree of the best-know methods in the literature. Experimental and statistical analyses show that the new heuristic provides better solutions regarding the so...

We consider the NP-hard no-wait flowshop scheduling problem with sequence-dependent setup times to minimize makespan. We propose a hybrid heuristic which combines the iterated greedy process with local search method based on a block swap operator. Experimental results show that the proposed heuristic is comparatively more effective than the existing metaheuristics.

This paper presents a meta-heuristic algorithm for solving a job shop scheduling problem involving both sequence dependent setup-times and the possibility of selecting alternative routes among the available machines. The proposed strategy is a variant of the Iterative Flattening Search (IFS) schema. This work provides three separate results: (1) a constraint-based solving procedure that extends...

We tackle the job shop scheduling problem with sequence dependent setup times and maximum lateness minimization by means of a tabu search algorithm. We start by defining a disjunctive model for this problem, which allows us to study some properties of the problem. Using these properties we define a new local search neighborhood structure, which is then incorporated into the proposed tabu search...

We consider Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines with Sequence-Dependent Setup Times (SBSFMMAL-SDST). We propose alternate Mixed Integer Programming (MIP) and Constraint Programming (CP) formulations. Our experiments show that while the MIP models could not solve relatively small instances, the CP approach seems more promising.