We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates.With the tool of asymptotic analysis, we prove Moose Toys that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems.To further enhance the performance of the SPTA-based algorithms, an BASIC SET improvement scheme based on local search is provided for moderate scale problems.New lower bound is presented for evaluating the asymptotic optimality of the algorithms.Numerical simulations demonstrate the effectiveness of the proposed algorithms.