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 …

In the last years, researchers are paying special attention to scheduling in distributed
environments due to the increasing benefits of multi-factory manufacture. In this paper, we …

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 …

Job evaluation and differentiation are crucial in scheduling. Since jobs can be represented
by vectors of processing times, the average, standard deviation, and skewness of job …

This paper focuses on two components of idle time and waiting time, namely core idle
time,∑ CIT i, and core waiting time,∑ CWT j. Both measures are relevant indicators of the …

In this paper, we address the assembly flowshop scheduling problem, which is a
generalisation of two well-known scheduling problems in the literature: the three-stage …

Permutation flow shop scheduling problem with makespan criterion is known to be NP-hard
if the number of machines is greater than two. The most known polynomial complexity …

We study an iterative beam search algorithm for the permutation flowshop (makespan and
flowtime minimization). This algorithm combines branching strategies inspired by recent …

In this paper we propose the evolutionary clustering search (ECS) algorithm combined with
a variable neighbourhood search (VNS) for the m-machine blocking flow shop scheduling …

This paper presents a heuristic and a metaheuristic algorithm for solving the challenging
single machine scheduling problem with release dates and sequence-dependent setup …