In cellular manufacturing systems, minimization of the completion time has a great impact on production

time, material flow, and productivity. An effective scheduling is crucial to attaining the

advantages of cellular manufacturing systems. In this paper, a Hybrid Particle Swarm Optimization (PSO-SA) algorithm is proposed to solve a cellular flowshop scheduling problem with family sequence-dependent setup time. The proposed PSO-SA algorithm combines Particle Swarm Optimization (PSO) algorithm with Simulated Annealing (SA) as a local search to balance between diversification and intensification. The objective is to find the best sequence of families as well as jobs in each family in order to minimize total flow time; the problem is classified as: Fm n f mls;Selki; prumn?Nj=1Cj. The research problem is shown to be an NP-hard problem. PSO-SA is developed to improve the effectiveness of the PSO algorithm and to reduce the average variation from the lower bounds. The performance the proposed PSO-SA is evaluated based on the Relative Percentage Deviation (RPD) from lower bounds and compared with the best available algorithm. A Hybrid Particle Swarm Optimization and Simulate Annealing (PSO-SA) Algorithm for Scheduling a Flowshop Manufacturing cell with Sequence Dependent Setup Times Results showed that the hybridization of the PSO with SA improves the quality of the PSO algorithm and reduces the gap from the lower bounds especially for large problems.