Three meta-heuristics to solve the no-wait two-stage assembly ow-shop scheduling problem

This paper addresses the no-wait two-stage assembly flow-shop schedulingproblem (nwtsafsp) with the objective of makespan minimization. the problem is ageneralization of previously proposed general problem in the two-stage assembly flowshop scheduling problem (tsafsp). the tsafsp is np-hard, thus the nwtsafspis np-hard too, and three meta-heuristic algorithms, namely, genetic algorithm (ga),dierential evolution algorithm (dea) and population-based variable neighborhoodsearch (pvns) are proposed in this article to solve this problem. computational resultsreveal that pvns outperforms other algorithms in terms of average error and averagecoecient of variation (cv). nevertheless, ga has the least run time among the proposedalgorithms.