An enhanced invasive weed optimization for makespan minimization in a flexible flowshop scheduling problem

In previous investigations in the field of flexible flow shop scheduling problem, rework probability for operations was ignored. as these kinds of problems are np-hard, so we presented an enhanced invasive weed optimization (eiwo) meta-heuristic algorithm in order to solve the addressed problem with probable rework times, transportation times with a conveyor between two subsequent stages, different ready times and anticipatory sequence dependent setup times. the optimization criterion is to minimize makespan. although invasive weed optimization (iwo) is an efficient algorithm and has been attracted by many researchers recently, but to increase the capability of iwo, we added mutation operation to enhance the exploration in order to prevent sticking in local optimum. in addition, affinity function is embedded to obstruct premature convergence. with these changes, we balance exploration and exploitation of iwo. since, the performance of our proposed algorithm depends on parameters values, hence, we applied a popular design of experimental methodology called response surface method (rsm). to evaluate the proposed algorithm, first some random test problems were generated and compared with three benchmark algorithms. the related results were analyzed by statistical tools. the experimental results and statistical analyses demonstrated that the proposed eiwo was effective for the problem.