Monocriterion Optimization in Parallel Flow Shop.

EasyChair Preprint 8962

Abstract

Scheduling problems have always been widely discussed in the literature, such as the classical flow-shop scheduling problem(single path shop).On the contrary, the Parallel Flow-Shop Scheduling Problem (PFSSP), has received very little attention due to its complexity to be studied. In this paper, we focus on the latter, by proposing to minimize the criterion Makespan, two nature-inspired metaheuristics (Genetic algorithm and Particle Swarm) and we propose at the end of this work a comparison of the results obtained. by computing a performance index.

Keyphrases: Makespan, Metaheuristics, Monocriterion optimisation, Parallel Flow shop Scheduling Problem

@booklet{EasyChair:8962,
  author    = {Milad Mansouri and Younes Bahmani and Hacene Smadi},
  title     = {Monocriterion Optimization in Parallel Flow Shop.},
  howpublished = {EasyChair Preprint 8962},
  year      = {EasyChair, 2022}}