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 …

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the
permutation flowshop sequencing problem (PFSP) with the objectives of minimizing …

This paper proposes an effective particle swarm optimization (PSO)-based memetic
algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective …

In this paper, a discrete particle swarm optimization (DPSO) algorithm is presented to solve
the no-wait flowshop scheduling problem with both makespan and total flowtime criteria. The …

Abstract The Capacitated Vehicle Routing Problem is a well-known combinatorial problem.
In this paper, we propose a hybrid algorithm based on a discrete adaptation of the …

Obtaining an optimal solution for a permutation flowshop scheduling problem with the total
flowtime criterion in a reasonable computational timeframe using traditional approaches and …

In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the
permutation flowhop scheduling problem with the makespan criterion. The DDE algorithm is …

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

The job shop scheduling problem (JSSP) is a popular NP-hard scheduling problem that
simulates the scheduling problems of different real-world applications in fields such as …