In this paper, a method based on the particle swarm optimization method is proposed for solving flow shop scheduling problems. In the proposed method, a solution is represented by a product sequence. A solution is updated by copying a subsequence of the best solution in the solutions searched. The effectiveness of the proposed method is investigated through the computational result.