In the present communication, we propose a new algorithm to flow shop scheduling in which processing time of jobs are uncertain. The uncertain parameters are considered in triangular fuzzy numbers. The equivalent job for a job-block has also been included. By applying a new type of fuzzy arithmetic and a fuzzy ranking method, we explore a method to find optimal or near optimal sequence of jobs, without converting the fuzzy processing times to classical numbers. A numerical problem is given to illustrate the proposed method.
Triangular fuzzy number (TFN), Fuzzy processing time, Flow shop, Fuzzy ranking, Location index etc
