The blocking flow shop scheduling problem: A comprehensive and conceptual review
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 …
blocking conditions. In total, 139 papers are reviewed and classified, ranging from 1969 up …
Variable neighbourhood search: methods and applications
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the
permutation flowshop sequencing problem (PFSP) with the objectives of minimizing …
permutation flowshop sequencing problem (PFSP) with the objectives of minimizing …
An effective PSO-based memetic algorithm for flow shop scheduling
B Liu, L Wang, YH Jin - … Systems, Man, and Cybernetics, Part B …, 2007 - ieeexplore.ieee.org
This paper proposes an effective particle swarm optimization (PSO)-based memetic
algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective …
algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective …
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
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 …
the no-wait flowshop scheduling problem with both makespan and total flowtime criteria. The …
A robust algorithm based on Differential Evolution with local search for the Capacitated Vehicle Routing Problem
IP Souza, MCS Boeres, REN Moraes - Swarm and Evolutionary …, 2023 - Elsevier
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 …
In this paper, we propose a hybrid algorithm based on a discrete adaptation of the …
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
Obtaining an optimal solution for a permutation flowshop scheduling problem with the total
flowtime criterion in a reasonable computational timeframe using traditional approaches and …
flowtime criterion in a reasonable computational timeframe using traditional approaches and …
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
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 …
permutation flowhop scheduling problem with the makespan criterion. The DDE algorithm is …
Variable neighbourhood search: methods and applications
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
Discrete hybrid cuckoo search and simulated annealing algorithm for solving the job shop scheduling problem
F Alkhateeb, BH Abed-alguni, MH Al-rousan - The Journal of …, 2022 - Springer
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 …
simulates the scheduling problems of different real-world applications in fields such as …