View article

The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The particle swarm optimization (PSO) is an evolutionary algorithm that uses a population of candidate solutions to develop an optimal solution to the problem. This paper aims to study the performance of centralized and distributed PSO solutions to solve the FJSP. It presents various implementations of PSO: serial, centralized parallel, distributed and multi agent. Then, it compares the performances obtained on a workstation against the Raspberry B+ credit-card sized computer, both running Java SE embedded virtual machine.