This paper introduces a tabu search heuristic for a production scheduling problem with sequence-dependent and time-dependent setup times on a single machine. The problem consists in scheduling a set of dependent jobs, where the transition between two jobs comprises an unrestricted setup that can be performed at any time, and a restricted setup that must be performed outside of given time interv...

Single machine scheduling problems with earliness and tardiness penalty are well known, but in the case of sequence dependent, the problem is more difficult and there are few researches around it. In related researches, setup time matrix was defined as a deterministic matrix. In this paper sequence dependent single machine scheduling with earliness tardiness penalty considerations using fuzzy s...

In this paper, we propose three new metaheuristic implementations to address the problem of minimizing the makespan in a hybrid flexible flowshop with sequence-dependent setup times. The first metaheuristic is a genetic algorithm (GA) embedding two new crossover operators, and the second is an ant colony optimization (ACO) algorithm which incorporates a transition rule featuring lookahead infor...

This work addresses the unrelated parallel machine scheduling problem where setup times are sequence-dependent and machine-dependent. The maximum completion time of the schedule, known as makespan, is considered as an objective to minimize. Few studies has been done about this problem, which is a motivation to the development of this work. Other motivations are the fact that it is NP-Hard and i...

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...