This paper presents a literature review on the m-machine flow shop scheduling problem with
blocking conditions. In total, 139 papers are reviewed and classified, ranging from 1969 up …

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 …

Sustainable scheduling problems have been attracted great attention from researchers. For
the flow shop scheduling problems, researches mainly focus on reducing economic costs …

The trend of globalization has recently seen the study of distributed scheduling problems.
This study attempts to solve the distributed hybrid flowshop scheduling problem with …

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 …

Recently, iterated greedy algorithms have been successfully applied to solve a variety of
combinatorial optimization problems. This paper presents iterated greedy algorithms for …

The no-wait flow shop scheduling problem (NWFSP) plays an essential role in the
manufacturing industry. Inspired by the overall process of biogeography theory, the standard …

This paper considers n-job m-machines blocking flow-shop scheduling problem (BFSP) with
sequence-dependent setup times (SDST), which has important ramifications in the modern …

This paper proposes an island neighboring heuristics harmony search algorithm (INHS) to
tackle the blocking flow-shop scheduling problem. The island model is used to diversify the …

We consider the m-machine no-wait flowshop scheduling problem with respect to two
performance measures; total tardiness and makespan. Our objective is to minimize total …