Heuristics methods for the flow shop scheduling problem with separated setup times

Abstract

This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics, four heuristics methods are proposed with procedures of the construction sequencing solution by an analogy with the asymmetric traveling salesman problem with the objective of minimizing makespan. Experimental results show that one of the new heuristics methods proposed provide high quality solutions in comparisons with the evaluated methods considered in the literature.

Keywords

• Programação da produção. Flow shop permutacional. Tempos de setup. Método heurístico. Duração total da programação.