We present some results attained with two variants of the bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the wellknown Taillard instances. We have improved the best-known ...

This paper deals with the blocking flow shop problem and proposes new constructive procedures for the total tardiness minimization of jobs. The heuristic has three-phases to build the sequence; the first phase selects the ...

In this paper we demonstrate that the relation between two jobs defined by min{ai, bj}=min{bi, aj}, used in Johnson’s theorem, is not transitive. However, both the theorem and Johnson’s algorithm are correct.

When various kinds of products must receive the sam e treatments in a production line of tanks and the size of batches is high, a cyclic manufacturing composed of a job from each batch can ...

This paper presents a high performing Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with flow time criterion. To develop the proposed algorithm, we considered four strategies for the food ...

This paper deals with the blocking flow shop problem and proposes an Iterated Local Search (ILS) procedure combined with a variable neighbourhood search (VNS) for the total tardiness minimisation. The proposed ILS makes ...

This paper deals with the problem of scheduling jobs in a parallel flow shop configuration under the blocking constraint, in which the setup time of machines depends not only on the job to be processed but also on the ...

Las líneas de montaje de automóviles presentan problemas de diseño y programación cada vez más complejos generados por la diversificación del producto mediante opciones ofertadas sobre un modelo base. El problema de ...