This paper proposes an Iterated Local Search (ILS) procedure and an Iterated Greedy (IG) algorithm, which are both combined with a variable neighbourhood search (VNS), for dealing with the flow shop problem with blocking, ...

In this paper, two tools to improve the performance of the NEH-based heuristics for the flow shop problem with and without buffer constraints are proposed. The first tool is the use of the reversibility property of the ...

In this paper, two tools to improve the performance of the NEHbased
heuristics for the flow shop problem with and without buffer constraints
are proposed. The first tool is the use of the reversibility property of ...

Jobs of more than two products (n>2) must be manufactured in a
production line of tanks. A hoist transports the jobs between tanks. If the size of both
batches is equal and the number of jobs is high, a cyclic scheduling ...

Jobs of two products must receive the same treatments in a production
line of tanks. If the size of both batches is equal, we propose a cyclic manufacturing
composed of a job from batch 1 and a job from batch 2. A hoist ...

This paper is the 5th updated version of “New insights on the blocking flow shop problem” (January 2010). Each release updates the solutions of precedent releases The values of the 2nd release (February 2010) were reproduced ...

This work deals with the permutation flow-shop scheduling problem
with and without storage space between stages, where the performance
criterion is the makespan. Many proposed procedures to solve these problems
have an ...