%0 Journal Article
%T Three meta-heuristics to solve the no-wait two-stage assembly flow shop scheduling problem
%J Scientia Iranica
%I Sharif University of Technology
%Z 1026-3098
%A Mozdgir, A.
%A Fatemi Ghomi, S.M.T.
%A Jolai, F.
%A Navaei, J.
%D 2013
%\ 12/01/2013
%V 20
%N 6
%P 2275-2283
%! Three meta-heuristics to solve the no-wait two-stage assembly flow shop scheduling problem
%K No-wait assembly flow-shop
%K Genetic Algorithm
%K Differential Evolution Algorithm
%K Population-based variable neighborhood search
%R
%X This paper addresses the no-wait two-stage assembly flow shop scheduling problem (NWTSAFSP) with the objective of makespan minimization. The problem is a generalization of previously proposed general problem in the two-stage assembly flow shop scheduling problem (TSAFSP). The TSAFSP is NP-hard, thus the NWTSAFSP is NP-hard too and three meta-heuristic algorithms namely genetic algorithm (GA), differential evolution algorithm (DEA) and population-based variable neighborhood search (PVNS) are proposed in this article to solve this problem. Computational results reveal that PVNS outperforms other algorithms in terms of average error and average coefficient of variation (CV). Nevertheless, GA has the least run time among the proposed algorithms.
%U https://scientiairanica.sharif.edu/article_3461_5a101d9e9283c121adcb2bc75562732d.pdf