Modified snake optimiser algorithm for solving the permutation flow shop scheduling problem
A modified snake optimiser (MSO) for NP-hard permutation flow shop scheduling problem (PFSP), which shows that MSO consistently outperforms its competitors on complex issues, demonstrating its usefulness as a robust approach for PFSP.