This paper proposes approaches for combining the Iterated Greedy (IG) technique, as a presently state-of-the-art method, with a recently proposed adapted ...

Abstract—This paper proposes approaches for combining the. Iterated Greedy (IG) technique, as a presently state-of-the-art method, with a recently proposed ...

This paper studies the hybrid flow shop scheduling problem with blocking constraints (BHFSP). To better understand the BHFSP, we will construct its mixed ...

This paper proposes approaches for combining Iterated Greedy techniques, as state-of-the-art methods, with bacterial evolutionary algorithms based on a ...

This paper proposes and analyse parallel hybrid search methods that fully use the computational power of current multi-core machines and indicates that the ...

Jan 29, 2024 · This study investigates the no-wait flow shop scheduling problem and proposes a hybrid (HES-IG) algorithm that utilizes makespan as the ...

The proposed heuristic methods are quite efficient for permutation flowshop scheduling problems, where jobs are processed on machines in the same order (Dubois- ...

This paper addresses a sub-population based hybrid monkey search algorithm to solve the flow shop scheduling problem which has been proved to be ...

Finally, starting with the best constructive heuristic, we develop an iterated greedy metaheuristic to find near-optimal solutions in large-sized instances.

Hybrid Bacterial Iterated Greedy heuristics for the Permutation Flow Shop Problem · Computer Science, Engineering. 2012 IEEE Congress on Evolutionary Computation.