Hassan Almazini

Modified snake optimizer algorithm for solving the permutation flow shop scheduling problem

Minimising the makespan for large job sets is the goal of the algorithmically intensive NP-hard permutation flow shop scheduling problem (PFSP), which is crucial for real-world applications. Originally designed for continuous optimisation, the snake optimiser is a recently discovered swarm-based metaheuristic that may...