The problem of scheduling in flowshops with the objective of minimizing makespan, total flowtime and completion time variation is studied in this paper. A simple discrete version of Particle Swarm Optimization Algorithm (PSO) is proposed for solving the set of benchmark flowshop scheduling problems proposed by Taillard [1]. The obtained results are better when compared with the results published in the literature. © 2006 IEEE.