Multi-item and small-lot-size production modes lead to frequent setup, which involves significant setup times has a substantial impact on productivity. In this study, we investigated the optimal flexible job-shop scheduling problem with sequence-dependent time. We built mathematical model objective of minimization maximum completion time (makespan). Considering process sequence, is influenced b...

This research combines between two different manufacturing concepts. On the one hand, flow shop scheduling is a well-known problem in production systems. The problem appears when a group of jobs shares the same processing sequence on two or more machines sequentially. Flow shop scheduling tries to find the appropriate solution to optimize the sequence order of this group of jobs over the existi...

The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence to design the strategy of local searching and an extremal optimization in information exchange. The computational result shows that the propos...

Abstract This paper deals with a reentrant hybrid flow shop problem sequence-dependent setup time and limited buffers where there are multiple unrelated parallel machines at each stage. A mathematical model the minimization of total weighted completion is constructed for this problem. Considering complexity hand, an effective cooperative adaptive genetic algorithm (CAGA) proposed. In algorithm,...

In this work we present a metaheuristic method based on tabu search for solving the permutation flow shop scheduling problem with sequence dependent setup times, with the objective of minimizing total weighted tardiness. The problem is well known for its practical applications and for the difficulty in obtaining good solutions. The tabu search method proposed is based on the insertion neighborh...

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