In industry, production is often organized in the form of a hybrid flow shop, and there is great
interest in methods and algorithms for optimizing such production processes. While, thus far …

The scheduling of flow shops with multiple parallel machines per stage, usually referred to
as the hybrid flow shop (HFS), is a complex combinatorial problem encountered in many …

The distributed permutation flowshop problem has been recently proposed as a
generalization of the regular flowshop setting where more than one factory is available to …

After 50 years of research in the field of flowshop scheduling problems the scientific
community still observes a noticeable gap between the theory and the practice of …

This paper presents a genetic algorithm to solve the hybrid flow shop scheduling problem to
minimize the total tardiness. Practical assumptions as unrelated machines and machine …

The hybrid flowshop scheduling (HFS) problem with the objective of minimising the
makespan has important applications in a variety of industrial systems. This paper presents …

Industries require, nowadays, to be more adaptable to unforeseen real-time events as well
as to the rapid evolution of their market (eg multiplication of customers, increasingly …

Obtaining economic and reliable schedules constitutes the core of excellence in customer
service and of efficiency in manufacturing operations. While few areas have been more …

This paper proposes a total of nine algorithms to minimize the makespan for the hybrid
flowshop scheduling problem with sequence-dependent setup times. The first six algorithms …

This paper aims to contribute to the recent research efforts to bridge the gap between the
theory and the practice of scheduling by modelizing a realistic manufacturing environment …