Therefore, job shop scheduling problem with fuzzy processing time is addressed in the paper. The processing time is described by triangular fuzzy numbers. The objective is to find a job sequence that minimizes the makespan and the uncertainty of the makespan by using an approach for ranking fuzzy numbers