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 problem of scheduling jobs in a parallel flow shop environment without buffers between machines and with sequence-dependent setup times in order to minimize the maximum completion time of jobs. ...

Based on the analysis of the pertinent literature, we propose a framework to serve as a guide in designing a distribution network as a component of a supply chain (SC). It consists of three steps that are common to goods ...

Purpose: Since the emergence of Lean Manufacturing many organizations strived to implement it. Nonetheless, sustainable Lean transformation is not as easy as to be simply achieved. Several aspects need to be taken into ...

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.

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 minimization. The proposed ILS makes ...

This paper proposes an iterated greedy algorithm for scheduling jobs in F parallel flow shops (lines), each consisting of a series of m machines without storage capacity between machines. This constraint can provoke the ...

Social and economic trends have strongly changed in the last years due to the economic crisis and the evolution of technology. These factors have influenced a sharing revolution, also in the mobility sector motivated for ...

A continuación se presentan las mejores soluciones obtenidas para los ejemplares de Ronconi, Imma-B y Imma-C instances utilizados en el problema Fm|block|ΣT. Los valores han sido obtenidos con la hyperheuristica CERCOP0T.