In this paper, a new greedy algorithm is proposed to solve the fuzzy multiobjective flow shop scheduling problem. We use the two approaches; the possibility measure and the area of intersection for multi objective fuzzy flow shop scheduling problem. The proposed new greedy algorithm is tested on the benchmark problems in the literature. The performance parameters of proposed greedy algorithm are determined by full factorial design of experiments (DOE). The performance of the proposed greedy algorithm is compared with the scatter search method.