Scheduling is the process of allocating resources over time to competitive activities such that a certain number of goals can be achieved while the given constraints can be satisfied. This paper aims to compare and analyze the performance of two heuristic algorithms in solving flow shop scheduling problem with fuzzy processing time to minimize the makespan and the mean flow time. The heuristic algorithms used are namely Palmer’s and Campbell, Dudek, and Smith (CDS) algorithms. The processing times of all the jobs on machines are represented by triangular fuzzy numbers. In order to evaluate the performance of the heuristic algorithms, 12 benchmark problems of small size are used and compared using a MATLAB program. The computational results show that the CDS algorithm slightly outperformed Palmer’s algorithm.