A Novel Hybrid Recruit Simulated Annealing and Rat Swarm Optimization Algorithm for Permutation Flow Shop Scheduling

ABSTRACT The permutation flow shop scheduling problem (PFSSP) is a classical NP‐hard problem that aims to determine an optimal job sequence across machines to minimize makespan. Existing swarm intelligence and evolutionary algorithms often suffer from premature convergence, parameter sensitivity, an...

ver descrição completa

Detalhes bibliográficos

Principais autores:	Mourad Mzili, Mouna Torki, Toufik Mzili, Mohammed Benzakour Amine, Nebojsa Bacanin, Momina Shaheen
Formato:	Artigo
Idioma:	Inglês
Publicado em:	Wiley 2026-04-01
Colecção:	Engineering Reports
Assuntos:	heuristics hybrid algorithm makespan optimization permutation flow shop scheduling rat swarm optimization simulated annealing
Acesso em linha:	https://doi.org/10.1002/eng2.70724
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!