A new algorithm inspired from particle swarm optimization method is successfully implemented for flexible job-shop work-shop optimization problems. Its efficiency for solving combinatory problems is comparable to the genetic algorithms one taking into account the Makespan criterion.
Particle Optimization Method (SPO), Flexible Job-Shop Problem (FJSP), Makespan.
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).