Fuzzy Flow Shop Scheduling Problems with transportation time & weightage of jobs
Abstract
Flow shop scheduling is a decision making problem in production and manufacturing field which has a significant impact on the performance of an organization. This paper provides a new approach to find an optimal sequence which minimises the total make span, for n-job 4 machines fuzzy flow shop scheduling problem, involving fuzzy processing time. Further weightage of jobs that includes relative importance of a job over other jobs is also considered. When the machines on which jobs are to be processed are placed at different places, the transportation time plays a significant role in production. Here we propose a method to minimize the total make span; without converting the fuzzy processing time to classical numbers by using a new type of fuzzy arithmetic and a fuzzy ranking method. The validity of the proposed method is examined with a numerical example