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 …

In this paper, an extensive review of recently published papers on hybrid flow shop (HFS)
scheduling problems is presented. The papers are classified first according to the HFS …

The Flexible flow shop (FFS) is defined as a multi-stage flow shops with multiple parallel
machines. FFS scheduling problem is a complex combinatorial problem which has been …

Hybrid flow shop scheduling problems have a special structure combining some elements of
both the flow shop and the parallel machine scheduling problems. Multiprocessor task …

This research investigates a two-stage no-wait hybrid flow-shop scheduling problem in
which the first stage contains a single machine, and the second stage contains several …

This paper proposes a hybrid variable neighborhood search (HVNS) algorithm that
combines the chemical-reaction optimization (CRO) and the estimation of distribution (EDA) …

Considering the practical application and the computational complexity of the two-stage no-
wait hybrid flow shop scheduling problem, this paper proposes a genetic algorithm (GA) …

This paper investigates an integrated bi-objective optimisation problem with non-resumable
jobs for production scheduling and preventive maintenance in a two-stage hybrid flow shop …

The scheduling problems in mass production, manufacturing, assembly, synthesis, and
transportation, as well as internet services, can partly be attributed to a hybrid flow-shop …

This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the
makespan value. In recent years, much attention is given to heuristic and search techniques …