A Novel Genetic Algorithm For A Flow Shop Scheduling Problem With Fuzzy Processing Time

Various procedures, methods, constraints and objectives are studied in a flow shop problem during the past decades. in order to adapt the problem to the reality form, its parameters are considered as a fuzzy model. in this problem, we consider the processing time as the trapezoidal fuzzy numbers. the purpose of this problem is to find an optimum sequence in a way that the makespan or the completing time of jobs to be minimized. in order to solve this problem, in this paper, the random-elitist genetic algorithm (rega) is presented in this regard. observing the performance and the efficiency of this algorithm, we code it by the vba and compare with the other results. we first test the performance of different crossover operators for our algorithm. next, using a specific example, we examine the performance of our algorithm. the results indicated that due to very good searching; this algorithm has the good performance in finding the optimal solution and reaching the optimum solution in a very short time.